A Combinatorial Proof of the Enumeration of Alternating Permutations with Given Peak Set
Combinatorics
2012-04-06 v1
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.
Keywords
Cite
@article{arxiv.1204.1141,
title = {A Combinatorial Proof of the Enumeration of Alternating Permutations with Given Peak Set},
author = {Alina F. Y. Zhao},
journal= {arXiv preprint arXiv:1204.1141},
year = {2012}
}
Comments
4 pages, 2 figures