A formula for enumerating permutations with a fixed pinnacle set

DOI10.1016/j.disc.2021.112375zbMath1462.05019arXiv2001.07325OpenAlexW3151839136MaRDI QIDQ2022165

Pamela E. Harris, Isabella Huang, Erik Insko, Alexander Diaz-Lopez, Lars Nilsen

Publication date: 28 April 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

peaks of permutationsFoata-Strehl group action on \(\mathfrak{S}_n\)pinnacles of permutations

Mathematics Subject Classification ID

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

Related Items (8)

Pinnacle set properties ⋮ Pinnacle sets of signed permutations ⋮ Efficient recurrence for the enumeration of permutations with fixed pinnacle set ⋮ Further results on pinnacle sets ⋮ Moments of permutation statistics and central limit theorems ⋮ Pinnacle sets revisited ⋮ Admissible pinnacle orderings ⋮ On \(q\)-analogs of descent and peak polynomials

Cites Work

• Sorting permutations with fixed pinnacle set
• Faces of generalized permutohedra
• The pinnacle set of a permutation
• Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers
• Actions on permutations and unimodality of descent polynomials
• Catalan Numbers
• Permutations with given peak set

This page was built for publication: A formula for enumerating permutations with a fixed pinnacle set