A combinatorial proof for the enumeration of alternating permutations with given peak set

zbMATH Open1295.05024arXiv1204.1141MaRDI QIDQ2866622

Alina F. Y. Zhao

Publication date: 13 December 2013

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1204.1141

zbMATH Keywords

alternating permutationreverse alternating permutation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (2)

Shuffle-compatible permutation statistics. II: The exterior peak set ⋮ Permutations with given peak set

Recommendations

• Title not available (Why is that?) 👍 👎
• A combinatorial proof of a result for permutation pairs 👍 👎
• A \(q\)-enumeration of alternating permutations 👍 👎
• Enumeration of permutations by number of alternating descents 👍 👎
• A combinatorial proof of the log-concavity of a famous sequence counting permutations 👍 👎
• A formula for enumerating permutations with a fixed pinnacle set 👍 👎
• Counting permutations by peaks, descents, and cycle type 👍 👎
• The number of permutations with the same peak set for signed permutations 👍 👎
• Permutations with given peak set 👍 👎
• On distribution of the number of peaks and the Euler numbers of permutations 👍 👎

This page was built for publication: A combinatorial proof for the enumeration of alternating permutations with given peak set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866622)