Clustering of consecutive numbers in permutations avoiding a pattern of length three or avoiding a finite number of simple patterns
Ross G. Pinsky

TL;DR
This paper derives explicit and asymptotic formulas for the expected number of consecutive pattern occurrences in permutations avoiding certain patterns of length three or more, including simple and separable permutations.
Contribution
It provides the first explicit formulas for these expectations across all pattern-avoiding classes of permutations, extending to asymptotic behaviors as permutation size grows.
Findings
Explicit formulas for expected pattern occurrences in pattern-avoiding permutations.
Asymptotic formulas for large permutation sizes and pattern lengths.
Results include special classes like separable permutations.
Abstract
For , let denote the set of permutations in that avoid the pattern , and let denote the expectation with respect to the uniform probability measure on . For and , let denote the number of occurrences of consecutive numbers appearing in consecutive positions in , and let denote the number of such occurrences for which the order of the appearance of the numbers is the pattern . We obtain explicit formulas for and , for all , all and all . These exact formulas then yield asymptotic formulas as with fixed, and as…
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 · Algorithms and Data Compression
