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

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

1997-03-25

arxiv.org/abs/math/9703209v1

Mathematics

Combinatorics

Scientific paper

We give a combinatorial proof of the result of Hetyei and Reiner that there are exactly $n!/3$ permutations of length $n$ in the minmax tree representation of which the $i$th node is a leaf. We also prove the new result that the number of $n$-permutations in which this node has one child is $n!/3$ as well, implying that the same holds for those in which this node has two children.

Affiliated with

Also associated with

No associations

Rating

A Combinatorial proof of a result of Hetyei and Reiner on Foata-Strehl type permutation trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Combinatorial proof of a result of Hetyei and Reiner on Foata-Strehl type permutation trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial proof of a result of Hetyei and Reiner on Foata-Strehl type permutation trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391543