Sorting permutations with fixed pinnacle set

DOI10.37236/9231zbMath1445.05006arXiv2001.08417OpenAlexW3082047108MaRDI QIDQ785571

Irena Rusu

Publication date: 7 August 2020

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

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

zbMATH Keywords

balanced reversals

Mathematics Subject Classification ID

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

Related Items (6)

Pinnacle set properties ⋮ Pinnacle sets of signed permutations ⋮ Efficient recurrence for the enumeration of permutations with fixed pinnacle set ⋮ Further results on pinnacle sets ⋮ A formula for enumerating permutations with a fixed pinnacle set ⋮ Admissible pinnacle orderings

Cites Work

• Unnamed Item
• \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
• Value-peaks of permutations
• Peak quasisymmetric functions and Eulerian enumeration
• The pinnacle set of a permutation
• New results on the peak algebra.
• Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
• Permutations with given peak set
• A proof of the peak polynomial positivity conjecture

This page was built for publication: Sorting permutations with fixed pinnacle set