2014/10/01 by Jonathan Bloom, Bloom, Jonathan, Alex Burstein +1
Arts and Humanities · Computer Science · Mathematics · #05A05 #05A15 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Language, Linguistics, Cultural Analysis #math.CO #msc:05A05 #msc:05A15 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1410.0230
20 pages, 6 figures (published version)
openalex publication_date 2014/10/01 · arxiv created 2015/11/01 · arxiv updated 2015/11/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Egge conjectured that permutations avoiding the set of patterns \2143,3142,τ\, where τ∈\246135,254613,263514,524361,546132\, are enumerated by the large Schröder numbers. Consequently, \2143,3142,τ\ with τ as above is Wilf-equivalent to the set of patterns \2413,3142\. Burstein and Pantone proved the case of τ=246135. We prove the remaining four cases. As a byproduct of our proof, we also enumerate the case τ=4132.