Non-ambiguous trees: new results and generalisation
classification
🧮 math.CO
keywords
natstreesformulanon-ambiguousbinarycombinatoriallydefinitiondescribed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.