Rooted quasi-Stirling permutations of general multisets
Shishuo Fu, Yanlin Li

TL;DR
This paper introduces rooted quasi-Stirling permutations of multisets, providing bijective proofs of key identities, extending previous results, and confirming a conjecture with new combinatorial interpretations.
Contribution
It presents a new bijective proof linking rooted quasi-Stirling permutations with Eulerian polynomials and confirms a recent $ ext{γ}$-positivity conjecture with novel statistics.
Findings
Established a bijective proof of an identity relating permutations and Eulerian polynomials.
Proved a Carlitz type identity for quasi-Stirling polynomials on multisets.
Confirmed a partial $ ext{γ}$-positivity conjecture and provided combinatorial interpretations.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · graph theory and CDMA systems
