Bijections in weakly increasing trees via binary trees
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_ | 1866913689344409600 |
|---|---|
| author | Li, Yang Lin, Zhicong |
| author_facet | Li, Yang Lin, Zhicong |
| contents | As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we construct four bijections on weakly increasing trees in the same flavor via switching the role of left child and right child of some specified nodes in their corresponding binary trees. Consequently, bijective proofs of the aforementioned symmetries found by Dong et al. and a non-recursive construction of a bijection on plane trees of Deutsch are provided. Applications of some symmetries in weakly increasing trees to permutation patterns and statistics will also be discussed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_09161 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bijections in weakly increasing trees via binary trees Li, Yang Lin, Zhicong Combinatorics As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we construct four bijections on weakly increasing trees in the same flavor via switching the role of left child and right child of some specified nodes in their corresponding binary trees. Consequently, bijective proofs of the aforementioned symmetries found by Dong et al. and a non-recursive construction of a bijection on plane trees of Deutsch are provided. Applications of some symmetries in weakly increasing trees to permutation patterns and statistics will also be discussed. |
| title | Bijections in weakly increasing trees via binary trees |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2502.09161 |