Statistics on clusters and $r$-Stirling permutations
Sergi Elizalde, Justin M. Troyka, Yan Zhuang

TL;DR
This paper extends the cluster method to count permutations with specific consecutive patterns and permutation statistics, revealing connections to $r$-Stirling permutations and providing formulas for joint enumeration.
Contribution
It generalizes the cluster method to include permutation statistics and uncovers a new link between pattern clusters and $r$-Stirling permutations.
Findings
Formulas for counting permutations with pattern $2134\cdots m$ and statistics
Symmetry-based results for pattern $12\cdots (m-2)m(m-1)$
Equinumerosity and joint distributions between clusters and $r$-Stirling permutations
Abstract
The GouldenJackson cluster method, adapted to permutations by Elizalde and Noy, reduces the problem of counting permutations by occurrences of a prescribed consecutive pattern to that of counting clusters, which are special permutations with a lot of structure. Recently, Zhuang found a generalization of the cluster method which specializes to refinements by additional permutation statistics, namely the inverse descent number , the inverse peak number , and the inverse left peak number . Continuing this line of work, we study the enumeration of -clusters by , , and , which allows us to derive formulas for counting permutations by occurrences of the consecutive pattern jointly with each of these statistics. Analogous…
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
TopicsBayesian Methods and Mixture Models · Advanced Combinatorial Mathematics · Advanced Mathematical Identities
