惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Visual Studio Blog
Stack Overflow Blog
Stack Overflow Blog
G
Google Developers Blog
Microsoft Azure Blog
Microsoft Azure Blog
Engineering at Meta
Engineering at Meta
L
LangChain Blog
T
The Blog of Author Tim Ferriss
J
Java Code Geeks
Y
Y Combinator Blog
月光博客
月光博客
雷峰网
雷峰网
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
F
Fortinet All Blogs
A
About on SuperTechFans
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
P
Proofpoint News Feed
小众软件
小众软件
H
Help Net Security
Last Week in AI
Last Week in AI
B
Blog RSS Feed
宝玉的分享
宝玉的分享
N
Netflix TechBlog - Medium
博客园 - 叶小钗
The GitHub Blog
The GitHub Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Labeled Plane Trees and Increasing Plane Trees
[Submitted on 3 Oct 2025 (v1), last revised 30 Jun 2026 (this ve · 2025-10-03 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:The main aim of this paper is to establish a polynomial analogue of $(n+1)!C_n=2^n(2n-1)!!$ (with $C_n$ as the $n$-th Catalan number) in the setting of labeled plane trees and increasing plane trees. This analogue is formulated in terms of improper edges of labeled plane trees and yields explicit formulas for the generating polynomials defined on labeled plane trees refined by improper and proper edges, together with a root-degree refinement for trees rooted at $0$. To prove this result, we construct a new involution on labeled plane trees, which implies that the number of improper edges and the number of proper edges are equidistributed over the set of labeled plane trees. We further apply this involution to establish pairwise symmetry properties of multivariable polynomials defined on labeled plane trees involving several classes of leaves and interior vertices. More precisely, certain specializations of these polynomials are invariant under the subgroup of $S_6$ generated by the three disjoint transpositions $(12)$, $(34)$, and $(56)$. As special cases, our results recover the symmetry properties for plane trees and tip-augmented plane trees due to Dong, Du, Ji and Zhang.
Finally, via the Koganov--Janson correspondence, improper edges of labeled plane trees correspond bijectively to improper arcs of quasi-Stirling permutations, leading to an explicit formula for the generating function defined on quasi-Stirling permutations refined by improper arcs.

Submission history

From: Kathy Qing Ji [view email]
[v1] Fri, 3 Oct 2025 14:20:47 UTC (9 KB)
[v2] Tue, 30 Jun 2026 06:49:49 UTC (21 KB)