Arbres minimax et polynômes d'André

Résumé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