Non-ambiguous trees: new results and generalization - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2020

Non-ambiguous trees: new results and generalization


We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differ- ential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of our formula. And we generalize NATs to higher dimension.
Fichier principal
Vignette du fichier
final_112.pdf (304.68 Ko) Télécharger le fichier

Dates and versions

hal-02173753 , version 1 (04-07-2019)



Jean-Christophe Aval, Adrien Boussicault, Bérénice Delcroix-Oger, Florent Hivert, Patxi Laborde-Zubieta. Non-ambiguous trees: new results and generalization. 28-th International Conference on Formal Power Series and Algebraic Combinatorics, Simon Fraser University, Jul 2016, Vancouver, Canada. ⟨10.46298/dmtcs.6414⟩. ⟨hal-02173753⟩
338 View
566 Download



Gmail Mastodon Facebook X LinkedIn More