Counting words without strictly increasing subwords of fixed length
Combinatorics
2025-11-18 v1 Mathematical Physics
math.MP
Probability
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.
Keywords
Cite
@article{arxiv.2511.13287,
title = {Counting words without strictly increasing subwords of fixed length},
author = {Senan Sekhon},
journal= {arXiv preprint arXiv:2511.13287},
year = {2025}
}
Comments
17 pages