Jean-Christophe Aval ; Adrien Boussicault ; Bérénice Delcroix-Oger ; Florent Hivert ; Patxi Laborde-Zubieta - Non-ambiguous trees: new results and generalization

dmtcs:6414 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) - https://doi.org/10.46298/dmtcs.6414
Non-ambiguous trees: new results and generalizationArticle

Authors: Jean-Christophe Aval 1; Adrien Boussicault 1; Bérénice Delcroix-Oger ORCID2; Florent Hivert ORCID3; Patxi Laborde-Zubieta 1

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.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Consultation statistics

This page has been seen 190 times.
This article's PDF has been downloaded 283 times.