Enumeration of several two-by-four classes
Sam Miner

TL;DR
This paper derives algebraic generating functions for specific permutation classes avoiding certain patterns, revealing their growth rates and typical structure of large permutations within these classes.
Contribution
It introduces a method using catalytic variables to explicitly compute algebraic generating functions for several permutation classes.
Findings
Generating functions are algebraic of degree two.
Growth rates are 4, 5, and approximately 4.17035.
Large permutations tend to also avoid certain additional patterns.
Abstract
We use catalytic variables to derive generating functions for the permutation classes , , and . Each generating function is algebraic of degree two, and the growth rates of the classes are 4, 5, and , respectively, where . As a consequence of our analysis, we see that a typical large permutation in is likely to also avoid , and is even more likely to avoid . Large permutations which avoid and are likely to also avoid .
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 · Algorithms and Data Compression · Advanced Mathematical Identities
