Egge triples and unbalanced Wilf-equivalence
Jonathan Bloom, Alex Burstein

TL;DR
This paper proves Egge's conjecture that certain pattern-avoiding permutations are counted by large Schr"oder numbers, establishing Wilf-equivalence for multiple pattern sets and enumerating an additional case.
Contribution
It completes the proof of Egge's conjecture for four cases and introduces enumeration for a new pattern set, advancing understanding of pattern avoidance and Wilf-equivalence.
Findings
Confirmed Egge's conjecture for four pattern sets
Established Wilf-equivalence between different pattern sets
Enumerated permutations avoiding a new pattern set
Abstract
Egge conjectured that permutations avoiding the set of patterns , where , are enumerated by the large Schr\"oder numbers. Consequently, with as above is Wilf-equivalent to the set of patterns . Burstein and Pantone proved the case of . We prove the remaining four cases. As a byproduct of our proof, we also enumerate the case .
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 · Language, Linguistics, Cultural Analysis · semigroups and automata theory
