Abstract
n inversion sequence of length n is a sequence of formulas presented. For a set of patterns B, let In(B) b the set of inversion sequences of length n that avoid all the patterns from B. We say that two sets of patterns B and C are I-Wilf-equivalent if formulas presented. In this paper, we show that the number of I-Wilf-equivalences among quadruples of length-3 patterns is at least 212 and at most 215, where three open cases remain.
| Original language | English |
|---|---|
| Article number | A78 |
| Journal | Integers |
| Volume | 23 |
| DOIs | |
| State | Published - 2023 |
Bibliographical note
Publisher Copyright:© 2023, Colgate University. All rights reserved.
ASJC Scopus subject areas
- Algebra and Number Theory
- Discrete Mathematics and Combinatorics