Pattern-avoiding modified ascent sequences
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908409424510976 |
|---|---|
| author | Cerbai, Giulio |
| author_facet | Cerbai, Giulio |
| contents | We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations avoiding a bivincular pattern of length three. We enumerate some patterns via bijections with other combinatorial structures such as Fishburn permutations, lattice paths and set partitions. We settle the last remaining case of a conjecture by Duncan and Steingrímsson by proving that modified ascent sequences avoiding 2321 are counted by the Bell numbers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_10027 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Pattern-avoiding modified ascent sequences Cerbai, Giulio Combinatorics 05A05 We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations avoiding a bivincular pattern of length three. We enumerate some patterns via bijections with other combinatorial structures such as Fishburn permutations, lattice paths and set partitions. We settle the last remaining case of a conjecture by Duncan and Steingrímsson by proving that modified ascent sequences avoiding 2321 are counted by the Bell numbers. |
| title | Pattern-avoiding modified ascent sequences |
| topic | Combinatorics 05A05 |
| url | https://arxiv.org/abs/2401.10027 |