Non-ambiguous trees: new results and generalisation

EUROPEAN JOURNAL OF COMBINATORICS(2015)

引用 0|浏览0
暂无评分
摘要
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.
更多
查看译文
关键词
trees,generalisation,non-ambiguous
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要