Abstract
We give a combinatorial proof of the result of Hetyei and Reiner that there are exactly permutations of length in the minmax tree representation of which the th node is a leaf. We also prove the new result that the number of -permutations in which this node has one child is as well, implying that the same holds for those in which this node has two children.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.