Arbres minimax et polynômes d'André
Arbres minimax et polynômes d'André
复制标题
DOI：
10.1006/aama.2001.0740
复制
发表时间：
2001-08
期刊：
影响因子：
--
通讯作者：
D. Foata;G. Han
中科院分区：
文献类型：
--
作者：
D. Foata;G. Han
在给定阶的极大极小树的集合上，可以定义两类运算：补运算和逆运算。我们研究这些操作的行动，并表明，它们的轨道枚举的组合对象以前介绍，如Hetyei-雷纳树，增加树，和安德烈树。由几个统计量，这些树的各种生成函数也被导出。
On the set of minimax trees of a given order there can be defined two families of operations, the complements and the reverses. We study the actions of those operations and show that their orbits are enumerated by combinatorial objects previously introduced, such as the Hetyei-Reiner trees, the increasing trees, and the Andre trees. Various generating functions for those trees by several statistics are also derived.