Aval, Jean-Christophe and Boussicault, Adrien and Delcroix-Oger, Bérénice and Hivert, Florent and Laborde-Zubieta, Patxi - 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)
Non-ambiguous trees: new results and generalization

Authors: Aval, Jean-Christophe and Boussicault, Adrien and Delcroix-Oger, Bérénice and Hivert, Florent and Laborde-Zubieta, Patxi

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
Submitted on: July 4, 2016
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]


Share

Consultation statistics

This page has been seen 62 times.
This article's PDF has been downloaded 24 times.