Non-ambiguous trees: new results and generalisation
Aval, Jean-Christophe · Boussicault, Adrien · Delcroix-Oger, Berenice · Hivert, Florent · Laborde-Zubieta, Patxi
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.