The insertion encoding of restricted growth functions
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910210154561536 |
|---|---|
| author | Bean, Christian Bell, Paul C. Ollson, Abigail |
| author_facet | Bean, Christian Bell, Paul C. Ollson, Abigail |
| contents | We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the classes for which these languages are regular. For the horizontal insertion encoding, we also prove that the conditions to be regular are the same for restricted growth functions of matchings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_17359 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The insertion encoding of restricted growth functions Bean, Christian Bell, Paul C. Ollson, Abigail Combinatorics 05 G.2.1 We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the classes for which these languages are regular. For the horizontal insertion encoding, we also prove that the conditions to be regular are the same for restricted growth functions of matchings. |
| title | The insertion encoding of restricted growth functions |
| topic | Combinatorics 05 G.2.1 |
| url | https://arxiv.org/abs/2510.17359 |