SearcharxivSearch

arXiv subjects

Lora R. Du

Publications and source records attributed to Lora R. Du.

4 recordsLinked to original sources

Labeled Plane Trees and Increasing Plane Trees

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.

math.CO

The inversion number statistic for inversion sequences

Inversion sequences, also known as subexcedant sequences, form a fundamental class of objects in enumerative combinatorics. In this paper, we study the joint distribution of five statistics on inversion sequences. While several statistics on inversion sequences have been extensively investigated, our contribution is to introduce the inversion number statistic, originally defined for permutations, into the context of inversion sequences. As special cases, we recover classical permutation statistics, including the Stirling, Mahonian and Eulerian distributions, as well as the Catalan and Narayana numbers. Somewhat unexpectedly, our specializations also include the number of involutions in the symmetric group. Our study arises from a $q$-analog of Comtet's expansion formula obtained by substituting the classical derivative operator $D$ with the $q$-derivative operator $D_q$.

math.CO

New refinements of Narayana polynomials and Motzkin polynomials

Chen, Deutsch and Elizalde introduced a refinement of the Narayana polynomials by distinguishing between old (leftmost child) and young leaves of plane trees. They also provided a refinement of Coker's formula by constructing a bijection. In fact, Coker's formula establishes a connection between the Narayana polynomials and the Motzkin polynomials, which implies the $γ$-positivity of the Narayana polynomials. In this paper, we introduce the polynomial $G_{n}(x_{11},x_{12},x_2;y_{11},y_{12},y_2)$, which further refine the Narayana polynomials by considering leaves of plane trees that have no siblings. We obtain the generating function for $G_n(x_{11},x_{12},x_2;y_{11},y_{12},y_2)$. To achieve further refinement of Coker's formula based on the polynomial $G_n(x_{11},x_{12},x_2;y_{11},y_{12},y_2)$, we consider a refinement $M_n(u_1,u_2,u_3;v_1,v_2)$ of the Motzkin polynomials by classifying the old leaves of a tip-augmented plane tree into three categories and the young leaves into two categories. The generating function for $M_n(u_1,u_2,u_3;v_1,v_2)$ is also established, and the refinement of Coker's formula is immediately derived by combining the generating function for $G_n(x_{11},x_{12},x_2;y_{11},y_{12},y_2)$ and the generating function for $M_n(u_1,u_2,u_3;v_1,v_2)$. We derive several interesting consequences from this refinement of Coker's formula. The method used in this paper is the grammatical approach introduced by Chen. We develop a unified grammatical approach to exploring polynomials associated with the statistics defined on plane trees. As you will see, the derivations of the generating functions for $G_n(x_{11},x_{12},x_2;{y}_{11},{y}_{12},y_2)$ and $M_n(u_1,u_2,u_3;v_1,v_2)$ become quite simple once their grammars are established.

math.CO

A Refinement of a Theorem of Diaconis-Evans-Graham

The note is dedicated to refining a theorem by Diaconis, Evans, and Graham concerning successions and fixed points of permutations. This refinement specifically addresses non-adjacent successions, predecessors, excedances, and drops of permutations.

math.CO