Pinnacle sets of signed permutations
From MaRDI portal
Publication:6041865
DOI10.1016/J.DISC.2023.113439zbMATH Open1514.05005arXiv2301.02628MaRDI QIDQ6041865FDOQ6041865
Authors: Nicolle S. González, Pamela E. Harris, Gordon Rojas Kirby, Mariana Vega Smit, Bridget Eileen Tenner
Publication date: 15 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2301.02628
Recommendations
Cites Work
- Title not available (Why is that?)
- Permutations with given peak set
- Enriched 𝑃-Partitions
- Peak sets of classical Coxeter groups
- Admissible pinnacle orderings
- The pinnacle set of a permutation
- Sorting permutations with fixed pinnacle set
- The number of permutations with the same peak set for signed permutations
- Descent polynomials
- A formula for enumerating permutations with a fixed pinnacle set
- Pinnacle set properties
- Efficient recurrence for the enumeration of permutations with fixed pinnacle set
- Further results on pinnacle sets
- Counting peaks on graphs
Cited In (7)
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)