Arbres minimax et polynômes d'André
✍ Scribed by Dominique Foata; Guo-Niu Han
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 221 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
✦ Synopsis
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 André trees. Various generating functions for those trees by several statistics are also derived.
📜 SIMILAR VOLUMES
Cet article e tait en re daction quand nous avons rec u le travail de Okounkov [8] qui aborde le me^me probleÁ me sous un angle comple mentaire. Okounkov e crit une formule du bino^me ge ne ralise e aÁ l'aide des poly-no^mes de Macdonald ``de cale s'' qu'il a e tudie s ailleurs [7]. Nous montrons a