Non-ambiguous trees: New results and generalisation (full version)

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

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.

arrow_drop_up