Pinnacle sets revisited
From MaRDI portal
Abstract: In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute , the number of permutations of with pinnacle set , and a conjectural closed formula for the related numbers . We determine the lexicographically minimal elements of the orbits of the modified Foata-Strehl action, prove that these elements form a lower ideal of the left weak order and characterize and count the maximal elements of this ideal.
Recommendations
Cites work
- A formula for enumerating permutations with a fixed pinnacle set
- Efficient recurrence for the enumeration of permutations with fixed pinnacle set
- Further results on pinnacle sets
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Permutation statistics related to a class of noncommutative symmetric functions and generalizations of the Genocchi numbers
- Pinnacle set properties
- Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers
- The pinnacle set of a permutation
Cited in
(2)
This page was built for publication: Pinnacle sets revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197699)