A Combinatorial Proof of the Enumeration of Alternating Permutations with Given Peak Set
arXiv:1204.1141
Abstract
Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.
4 pages, 2 figures