Stirling permutation codes
Abstract: The development of the theories of the second-order Eulerian polynomials began with the works of Buckholtz and Carlitz in their studies of an asymptotic expansion. Gessel-Stanley introduced Stirling permutations and presented combinatorial interpretations of the second-order Eulerian polynomials. Recently, there is a growing interest in the properties of Stirling permutations. The motivation of this paper is to develop a general method for finding equidistributed statistics on Stirling permutations. Firstly, we show that the up-down-pair statistic is equidistributed with ascent-plateau statistic, and that the exterior up-down-pair statistic is equidistributed with left ascent-plateau statistic. Secondly, we introduce the Stirling permutation codes. Several equidistribution results follow from simple applications. In particular, we find that six bivariable set-valued statistics are equidistributed on the set of Stirling permutations. As an application, we extend a classical result independently established by Dumont and Bona. Thirdly, we explore bijections among Stirling permutation codes, perfect matchings and trapezoidal words. We then show the e-positivity of the enumerators of Stirling permutations by left ascent-plateaux, exterior up-down-pairs and right plateau-descents. In the final part, the e-positivity of the multivariate k-th order Eulerian polynomials is established, which improves a result of Janson-Kuba-Panholzer and generalizes a recent result of Chen-Fu.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.