English

Counting Words Avoiding a Short Increasing Pattern and the Pattern 1k...2

Combinatorics 2019-01-29 v2

Abstract

We find finite-state recurrences to enumerate the words on the alphabet [n]r[n]^r which avoid the patterns 123 and 1k(k1)21k(k-1)\dots2, and, separately, the words which avoid the patterns 1234 and 1k(k1)21k(k-1)\dots2.

Keywords

Cite

@article{arxiv.1811.08314,
  title  = {Counting Words Avoiding a Short Increasing Pattern and the Pattern 1k...2},
  author = {Yonah Biers-Ariel},
  journal= {arXiv preprint arXiv:1811.08314},
  year   = {2019}
}
R2 v1 2026-06-23T05:22:18.778Z