Abstract
We give a combinatorial proof of the known result that there are exactlyn!/3 permutations of lengthn in the minmax tree representation of which theith node is a leaf.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Foata and M.P. Schützenberger, Nombres d'Euler et permutations alternantes, In: A Survey of Combinatorial Theory, J.N. Srivastava, et al., Eds., Amsterdam, North-Holland, 1973, pp. 173–187.
D. Foata and V. Strehl, Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers, Math. Z.137 (1974) 257–264.
D. Foata and V. Strehl, Euler numbers and variations of permutations, In: Colloquio Internazionale sulle Teorie Combinatorie, Roma, 1973, Atti Dei Convegni Lincei17, Accademia Nazionale dei Lincei, 1976, Tomo I, pp. 119–131.
G. Hetyei and E. Reiner, Permutation trees and variation statistics, In: Proc. of the 9th Conference on Formal Power Series and Algebraic Combinatorics, Vienna, 1997, to appear.
M. Purtill, André permutations, lexicographic shellability, and thecd—index of a convex polytope, Trans. Amer. Math. Soc.338 (1) (1993) 77–104.
Author information
Authors and Affiliations
Additional information
This paper was written while the author was a one-term visitor at Mathematical Sciences Research Institute in Spring 1997. This visit was supported by an MIT Applied Mathematics Fellowship.
Rights and permissions
About this article
Cite this article
Bóna, M. A combinatorial proof of a result of hetyei and reiner on Foata-Strehl-type permutation trees. Annals of Combinatorics 1, 119–122 (1997). https://doi.org/10.1007/BF02558469
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02558469