Non-ambiguous trees: new results and generalisation
Combinatorics
2015-12-01 v1
Abstract
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential 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.
Keywords
Cite
@article{arxiv.1511.09455,
title = {Non-ambiguous trees: new results and generalisation},
author = {Jean-Christophe Aval and Adrien Boussicault and Berenice Delcroix-Oger and Florent Hivert and Patxi Laborde-Zubieta},
journal= {arXiv preprint arXiv:1511.09455},
year = {2015}
}
Comments
Extended abstract