A new decomposition of ascent sequences and Euler--Stirling 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 equidistribution of and , where denotes the right-to-left minima statistic of ascent sequences. (iii) an extension of a conjecture posed by Levande, which asserts that the pair on ascent sequences has the same distribution as the pair on -avoiding inversion sequences. This is achieved via a decomposition of -avoiding inversion sequences parallel to that of ascent sequences. This work is motivated by a double Eulerian equidistribution of Foata (1977) and a tempting bi-symmetry conjecture, which asserts that the quadruples and are equidistributed on ascent sequences.
Keywords
Cite
@article{arxiv.1909.07277,
title = {A new decomposition of ascent sequences and Euler--Stirling statistics},
author = {Shishuo Fu and Emma Yu Jin and Zhicong Lin and Sherry H. F. Yan and Robin D. P. Zhou},
journal= {arXiv preprint arXiv:1909.07277},
year = {2019}
}
Comments
25 pages, to appear in Journal of Combinatorial Theory, Series A