Counting words without strictly increasing subwords of fixed length
Abstract
In this paper, we derive exact formulas for generating functions counting the number of n-ary words avoiding strictly increasing subwords of length k, and provide some applications of these formulas.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.