A combinatorial proof of a result of Hetyei and Reiner on Foata-Strehl-type permutation trees

DOI10.1007/BF02558469zbMath0927.05003arXivmath/9703209OpenAlexW2016409962MaRDI QIDQ1293437

Miklós Bóna

Publication date: 13 December 1999

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9703209

zbMATH Keywords

permutationstreefixed pointsgroup action

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Cites Work

• Permutation trees and variation statistics
• Andre Permutations, Lexicographic Shellability and the cd-Index of a Convex Polytope