A new decomposition of ascent sequences and Euler--Stirling statistics
Shishuo Fu, Emma Yu Jin, Zhicong Lin, Sherry H.F. Yan, Robin D.P. Zhou

TL;DR
This paper introduces a new recursive decomposition of ascent sequences, enabling detailed analysis of Euler--Stirling statistics, proving conjectures on distributional symmetries, and generalizing generating functions related to ascent sequences and inversion sequences.
Contribution
It presents a novel recursive decomposition method for ascent sequences, leading to new formulas, bijections, and proofs of conjectures on their statistical distributions.
Findings
Confirmed and extended Dukes and Parviainen's conjecture on zero and max distribution.
Derived a generalized generating function for ascent sequence statistics.
Established a bijective proof of quadruple equidistribution involving ascent sequence statistics.
Abstract
As shown by Bousquet-M\'elou--Claesson--Dukes--Kitaev (2010), ascent sequences can be used to encode -free posets. It is known that ascent sequences are enumerated by the Fishburn numbers, which appear as the coefficients of the formal power series In this paper, we present a novel way to recursively decompose ascent sequences, which leads to: (i) a calculation of the Euler--Stirling distribution on ascent sequences, including the numbers of ascents (), repeated entries , zeros () and maximal entries (). In particular, this confirms and extends Dukes and Parviainen's conjecture on the equidistribution of and . (ii) a far-reaching generalization of the generating function formula for due to Jel\'inek. This is accomplished via a bijective proof of the quadruple…
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 · Algebraic structures and combinatorial models · Advanced Mathematical Identities
