Permutations with given peak set
From MaRDI portal
Abstract: Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to be the set pi in Sym_n with P(pi)=S. Our main result is that for all fixed subsets of positive integers S and all sufficiently large n we have #P(S;n)= p(n) 2^{n-#S-1} for some polynomial p(n) depending on S. We explicitly compute p(n) for various S of probabilistic interest, including certain cases where S depends on n. We also discuss two conjectures, one about positivity of the coefficients of the expansion of p(n) in a binomial coefficient basis, and the other about sets S maximizing #P(S;n) when #S is fixed.
Recommendations
- The number of permutations with the same peak set for signed permutations
- Value-peaks of permutations
- A combinatorial proof for the enumeration of alternating permutations with given peak set
- Counting permutations by cyclic peaks and valleys
- The pinnacle set of a permutation
- Counting permutations by peaks, descents, and cycle type
- Sorting permutations with fixed pinnacle set
- scientific article; zbMATH DE number 1943960
- Permutations
Cited in
(44)- The peak algebra of the symmetric group
- Wilf equivalence relations for consecutive patterns
- A necessary condition for c-Wilf equivalence
- The pinnacle set of a permutation
- Some coefficient sequences related to the descent polynomial
- Descent polynomials
- A formula for enumerating permutations with a fixed pinnacle set
- Admissible pinnacle orderings
- On \(q\)-analogs of descent and peak polynomials
- Cyclic pattern containment and avoidance
- Central limit theorem for peaks of a random permutation in a fixed conjugacy class of \(S_n\)
- Pinnacle set properties
- Floodings of metric graphs
- Descent polynomials, peak polynomials and an involution on permutations
- On meteors, earthworms and wimps
- The number of permutations with the same peak set for signed permutations
- Counting signed permutations by their alternating runs
- Coefficients and roots of peak polynomials
- Factoring peak polynomials
- The peak statistics on simsun permutations
- A combinatorial proof for the enumeration of alternating permutations with given peak set
- Finitely dependent coloring
- Peak sets of classical Coxeter groups
- scientific article; zbMATH DE number 763827 (Why is no real title available?)
- Parking Functions: Choose Your Own Adventure
- Counting peaks on graphs
- A proof of the peak polynomial positivity conjecture
- A proof of the peak polynomial positivity conjecture
- Pinnacle sets of signed permutations
- Roots of descent polynomials and an algebraic inequality on hook lengths
- On distribution of the number of peaks and the Euler numbers of permutations
- Special values of spectral zeta functions and combinatorics: Sturm-Liouville problems
- Metrics on permutations with the same peak set
- Descent polynomials for labeled trees
- On graphs of sets of reduced words
- Interval and -interval rational parking functions
- Connecting descent and peak polynomials
- Growth rates of permutations with given descent or peak set
- On some discrete statistics of parking functions
- Log-concavity and log-convexity via distributive lattices
- Pinnacles for complex reflection groups
- Enumerative combinatorics. Abstracts from the workshop held January 11--16, 2026
- Sorting permutations with fixed pinnacle set
- Value-peaks of permutations
This page was built for publication: Permutations with given peak set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404323)
