Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rooted quasi-Stirling permutations of general multisets

Published 10 Nov 2021 in math.CO and cs.DM | (2111.05758v1)

Abstract: Given a general multiset M=1<sup>m1,2<sup>m2,…,n<sup>mn\mathcal{M}={1<sup>{m_1},2<sup>{m_2},\ldots,n<sup>{m_n}}, where ii appears mim_i times, a multipermutation π\pi of M\mathcal{M} is called {\em quasi-Stirling}, if it contains no subword of the form abababab with a≠ba\neq b. We designate exactly one entry of π\pi, say k∈Mk\in \mathcal{M}, which is not the leftmost entry among all entries with the same value, by underlining it in π\pi, and we refer to the pair (π,k)(\pi,k) as a quasi-Stirling multipermutation of M\mathcal{M} rooted at kk. 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 kk-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 γ\gamma-positivity conjecture due to Lin, Ma and Zhang, and find a combinatorial interpretation of the γ\gamma-coefficients in terms of two new statistics defined on quasi-Stirling multipermutations called sibling descents and double sibling descents.

Authors (2)
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.