The 26 Wilf-equivalence classes of length five quasi-consecutive patterns
Evan Chen, Shyam Narayanan

TL;DR
This paper classifies all quasi-consecutive patterns of length five into 26 Wilf-equivalence classes, providing new proofs for known classifications and expanding understanding of pattern equivalences in combinatorics.
Contribution
It introduces two families of Wilf-equivalences for vincular patterns and explicitly classifies all length five quasi-consecutive patterns into 26 classes.
Findings
Explicit classification of all length five quasi-consecutive patterns into 26 Wilf-equivalence classes.
New proofs for the classification of length 4 and 5 consecutive patterns.
Identification of two families of Wilf-equivalences for vincular patterns.
Abstract
We present two families of Wilf-equivalences for consecutive and quasi-consecutive vincular patterns. These give new proofs of the classification of consecutive patterns of length and . We then prove additional equivalences to explicitly classify all quasi-consecutive patterns of length into 26 Wilf-equivalence classes.
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
Topicssemigroups and automata theory · Advanced Combinatorial Mathematics · graph theory and CDMA systems
