Permutations that strongly avoid 132
Kassie Archer, Christina Graves

TL;DR
This paper studies permutations that avoid the pattern 132 in both the permutation and its square, providing enumeration results and confirming that their growth rate is 2.
Contribution
It introduces the concept of strong pattern avoidance and proves the growth rate for permutations strongly avoiding 132 is 2.
Findings
Enumerates permutations of size n strongly avoiding 132
Proves the growth rate of such permutations is 2
Confirms a conjecture about their asymptotic behavior
Abstract
A permutation strongly avoids the pattern if both and avoid . In this paper, we enumerate permutations of size that strongly avoid the pattern 132. This enumeration allows us to prove a conjecture that the growth rate of such permutations is 2.
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.
