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

preprint1997arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.