Pinnacle sets of signed permutations
From MaRDI portal
Publication:6041865
Abstract: Pinnacle sets record the values of the local maxima for a given family of permutations. They were introduced by Davis-Nelson-Petersen-Tenner as a dual concept to that of peaks, previously defined by Billey-Burdzy-Sagan. In recent years pinnacles and admissible pinnacles sets for the type symmetric group have been widely studied. In this article we define the pinnacle set of signed permutations of types and . We give a closed formula for the number of type / admissible pinnacle sets and answer several other related enumerative questions.
Recommendations
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- A formula for enumerating permutations with a fixed pinnacle set
- Admissible pinnacle orderings
- Counting peaks on graphs
- Descent polynomials
- Efficient recurrence for the enumeration of permutations with fixed pinnacle set
- Enriched 𝑃-Partitions
- Further results on pinnacle sets
- Peak sets of classical Coxeter groups
- Permutations with given peak set
- Pinnacle set properties
- Sorting permutations with fixed pinnacle set
- The number of permutations with the same peak set for signed permutations
- The pinnacle set of a permutation
Cited in
(8)- A characterization of one-element commutation classes
- Pinnacle set properties
- Admissible pinnacle orderings
- Further results on pinnacle sets
- Sorting permutations with fixed pinnacle set
- A formula for enumerating permutations with a fixed pinnacle set
- Pinnacle sets revisited
- The pinnacle set of a permutation
This page was built for publication: Pinnacle sets of signed permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041865)