Non-ambiguous trees: new results and generalisation (Full version)
Discrete Mathematics
2021-03-26 v2 Combinatorics
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 yields a new formula for the number of NATs. We also obtain q-versions of our formula. We finally generalise NATs to higher dimension.
Keywords
Cite
@article{arxiv.2103.07294,
title = {Non-ambiguous trees: new results and generalisation (Full version)},
author = {Bérénice Delcroix-Oger and Florent Hivert and Patxi Laborde-Zubieta and Jean-Christophe Aval and Adrien Boussicault},
journal= {arXiv preprint arXiv:2103.07294},
year = {2021}
}
Comments
full version of arXiv:2103.07294. European Journal of Combinatorics, Elsevier