A Combinatorial Proof of the Enumeration of Alternating Permutations with Given Peak Set

2012/04/05 by Zhao, Alina F. Y.
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/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.

Related

• Combinatorial study on the group of parity alternating permutations
• Enumeration of permutations by number of cyclic occurrence of peaks and valleys
• Pattern Matching in the Cycle Structure of Permutations
• Alternating permutations containing the pattern 123 or 321 exactly once
• Enumerations for Permutations by Circular Peak Sets