Rooted quasi-Stirling permutations of general multisets
arXiv:2111.05758
Abstract
Given a general multiset , where appears times, a multipermutation of is called {\em quasi-Stirling}, if it contains no subword of the form with . We designate exactly one entry of , say , which is not the leftmost entry among all entries with the same value, by underlining it in , and we refer to the pair as a quasi-Stirling multipermutation of rooted at . By introducing certain vertex and edge labeled trees, we give a new bijective proof of an identity due to Yan, Yang, Huang and Zhu, which links the enumerator of rooted quasi-Stirling multipermutations by the numbers of ascents, descents, and plateaus, with the exponential generating function of the {\em bivariate Eulerian polynomials}. This identity can be viewed as a natural extension of Elizalde's result on -quasi-Stirling permutations, and our bijective approach to proving it enables us to: (1) prove bijectively a Carlitz type identity involving quasi-Stirling polynomials on multisets that was first obtained by Yan and Zhu; (2) confirm a recent partial -positivity conjecture due to Lin, Ma and Zhang, and find a combinatorial interpretation of the -coefficients in terms of two new statistics defined on quasi-Stirling multipermutations called sibling descents and double sibling descents.
17 pages, comments are welcome
References in corpus (6)
- Gamma-positivity in combinatorics and geometry
- The symmetric and unimodal expansion of Eulerian polynomials via continued fractions
- Plane recursive trees, Stirling permutations and an urn model
- Pattern restricted quasi-Stirling permutations
- Quasi-Stirling Permutations on Multisets
- Partial -Positivity for Quasi-Stirling Permutations of Multisets