A new record for $1324$-avoiding permutations
Mikl\'os B\'ona

TL;DR
This paper improves the upper bound on the number of permutations avoiding the pattern 1324 by refining previous counting methods, advancing understanding of permutation pattern avoidance.
Contribution
It introduces a refined counting argument that yields a tighter upper bound for 1324-avoiding permutations, improving upon prior bounds.
Findings
Established a new upper bound for 1324-avoiding permutations
Refined existing counting techniques for permutation patterns
Enhanced understanding of permutation avoidance complexity
Abstract
Refining an existing counting argument, we provide an improved upper bound for the number of 1324-avoiding permutations of a given length.
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 · graph theory and CDMA systems · Algorithms and Data Compression
