Efficient recurrence for the enumeration of permutations with fixed pinnacle set

DOI10.46298/dmtcs.8321zbMath1525.05004arXiv2106.09147MaRDI QIDQ6045413

Wenjie Fang

Publication date: 30 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

enumerationrecurrencepermutationpinnacle set

Mathematics Subject Classification ID

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

Related Items (4)

Pinnacle set properties ⋮ Pinnacle sets of signed permutations ⋮ Further results on pinnacle sets ⋮ Pinnacle sets revisited

Cites Work

• Sorting permutations with fixed pinnacle set
• Combinatorial aspects of continued fractions
• Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
• The pinnacle set of a permutation
• A formula for enumerating permutations with a fixed pinnacle set
• Admissible pinnacle orderings
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient recurrence for the enumeration of permutations with fixed pinnacle set