Counting Words Avoiding a Short Increasing Pattern and the Pattern 1k...2
classification
🧮 math.CO
keywords
wordsavoiddots2patternpatternsalphabetavoidingcounting
read the original abstract
We find finite-state recurrences to enumerate the words on the alphabet $[n]^r$ which avoid the patterns 123 and $1k(k-1)\dots2$, and, separately, the words which avoid the patterns 1234 and $1k(k-1)\dots2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.