Counting words without strictly increasing subwords of fixed length
Senan Sekhon

TL;DR
This paper derives exact formulas for counting n-ary words that avoid strictly increasing subwords of a fixed length, with applications to combinatorial enumeration.
Contribution
It introduces new exact formulas for generating functions that count words avoiding certain increasing subword patterns.
Findings
Derived explicit formulas for generating functions
Provided applications in combinatorial enumeration
Enhanced understanding of pattern-avoiding words
Abstract
In this paper, we derive exact formulas for generating functions counting the number of -ary words avoiding strictly increasing subwords of length , and provide some applications of these formulas.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Limits and Structures in Graph Theory
