Even-up words and their variants
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912383956418560 |
|---|---|
| author | Fried, Sela |
| author_facet | Fried, Sela |
| contents | Inspired by OEIS sequence A377912, which consists of the nonnegative integers in which every even digit (except possibly the last) is immediately followed by a strictly larger digit, we define even-up and odd-up words over an alphabet of size~$k$ via similar constraints. We introduce and analyze weak and cyclic variants of these words, deriving explicit generating functions for all eight resulting classes. We then study Catalan words under analogous restrictions. Our results provide new combinatorial interpretations for many integer sequences, including the Motzkin numbers, the Riordan numbers, and the generalized Catalan numbers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_14196 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Even-up words and their variants Fried, Sela Combinatorics Inspired by OEIS sequence A377912, which consists of the nonnegative integers in which every even digit (except possibly the last) is immediately followed by a strictly larger digit, we define even-up and odd-up words over an alphabet of size~$k$ via similar constraints. We introduce and analyze weak and cyclic variants of these words, deriving explicit generating functions for all eight resulting classes. We then study Catalan words under analogous restrictions. Our results provide new combinatorial interpretations for many integer sequences, including the Motzkin numbers, the Riordan numbers, and the generalized Catalan numbers. |
| title | Even-up words and their variants |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2505.14196 |