Length-Four Pattern Avoidance in Inversion Sequences

Letong Hong; Rupert Li

doi:10.37236/10948

Length-Four Pattern Avoidance in Inversion Sequences

Combinatorics 2023-02-07 v2

Authors: Letong Hong , Rupert Li

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

Inversion sequences of length $n$ are integer sequences $e_1,\ldots ,e_n$ with $0\le e_i<i$ for all $i$ , which are in bijection with the permutations of length $n$ . In this paper, we classify all Wilf equivalence classes of pattern-avoiding inversion sequences of length-4 patterns except for one case (whether 3012 $\equiv$ 3201) and enumerate some of the length-4 pattern-avoiding inversion sequences that are in the OEIS.

Keywords

pattern avoidance in permutations

Cite

@article{arxiv.2112.15081,
  title  = {Length-Four Pattern Avoidance in Inversion Sequences},
  author = {Letong Hong and Rupert Li},
  journal= {arXiv preprint arXiv:2112.15081},
  year   = {2023}
}

Comments

To appear in Electronic Journal of Combinatorics. 15 pages

Related papers

View all related →