Non-ambiguous trees: new results and generalisation

2015/11/30 by Aval, Jean-Christophe, Boussicault, Adrien, Delcroix-Oger, Berenice +2
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1511.09455

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.

Related

• Non-ambiguous trees: new results and generalisation (Full version)
• Combinatorics of non-ambiguous trees
• Alternative Proof of the Determinant of Complete Non-Ambiguous Trees
• Complete non-ambiguous trees and associated permutations: new enumerative results
• A One-to-One Correspondence between Natural Numbers and Binary Trees