Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The 26 Wilf-equivale ...
Article

The 26 Wilf-equivalence classes of length five quasi-consecutive patterns

Evan Chen, Shyam Narayanan
Download article
Open on arXiv
Submitted on
October 30, 2017
Accepted on
October 9, 2018
Published on
October 24, 2018
Last modified on
March 31, 2025
Volume 20
vol. 20:2
Combinatorics
DOI
10.23638/DMTCS-20-2-12
License
arXiv.org - Non-exclusive license to distribute
National Science Foundation
1358659
An Undergraduate Research Program in Combinatorics and Number Theory
Indicators
1487
Views
613
Downloads

The 26 Wilf-equivalence classes of length five quasi-consecutive patterns

Evan Chen, Shyam Narayanan
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 $4$ and $5$. We then prove additional equivalences to explicitly classify all quasi-consecutive patterns of length $5$ into 26 Wilf-equivalence classes. Comment: 20 pages. Reformatted for DMTCS overlay journal
Keywords
  • Mathematics - Combinatorics
  • 05A05, 05A19
  • G.2.1
Preview
Loading PDF preview...