Non-ambiguous trees: new results and generalization

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

Discrete Mathematics & Theoretical Computer Science（2020）

引用 0|浏览1

暂无评分

摘要

We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differ- ential 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.

查看译文

关键词

[math.math-co]mathematics [math]/combinatorics [math.co]

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要