Counting words without strictly increasing subwords of fixed length
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908659426000896 |
|---|---|
| author | Sekhon, Senan |
| author_facet | Sekhon, Senan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_13287 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Counting words without strictly increasing subwords of fixed length Sekhon, Senan Combinatorics Mathematical Physics Probability 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. |
| title | Counting words without strictly increasing subwords of fixed length |
| topic | Combinatorics Mathematical Physics Probability |
| url | https://arxiv.org/abs/2511.13287 |