Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2403.13937 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911806950211584 |
|---|---|
| author | Prodinger, Helmut |
| author_facet | Prodinger, Helmut |
| contents | Instead of $k$-Dyck paths we consider the equivalent concept of $k$-non-crossing trees.
This is our preferred approach relative to down-step statistics modulo $k$ (first studied by Heuberger, Selkirk, and Wagner by different methods). One symmetry argument about subtrees is needed and the rest goes along the lines of a paper by Flajolet and Noy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_13937 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | k-non-crossing trees and edge statistics modulo k Prodinger, Helmut Combinatorics Instead of $k$-Dyck paths we consider the equivalent concept of $k$-non-crossing trees. This is our preferred approach relative to down-step statistics modulo $k$ (first studied by Heuberger, Selkirk, and Wagner by different methods). One symmetry argument about subtrees is needed and the rest goes along the lines of a paper by Flajolet and Noy. |
| title | k-non-crossing trees and edge statistics modulo k |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.13937 |