The pinnacle set of a permutation

DOI10.1016/J.DISC.2018.08.011zbMATH Open1395.05002OpenAlexW2612667993WikidataQ129298316 ScholiaQ129298316MaRDI QIDQ1783643FDOQ1783643

Authors Robert Davis, Sarah A. Nelson, T. Kyle Petersen, Bridget Eileen Tenner 

Publication date 21 September 2018

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

descent setpermutation statisticpeak set

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: The peak set of a permutation records the indices of its peaks. These sets have been studied in a variety of contexts, including recent work by Billey, Burdzy, and Sagan, which enumerated permutations with prescribed peak sets. In this article, we look at a natural analogue of the peak set of a permutation, instead recording the values of the peaks. We define the "pinnacle set" of a permutation w to be the set {w(i) : i is a peak of w}. Although peak sets and pinnacle sets mark the same phenomenon for a given permutation, the behaviors of these sets differ in notable ways as distributions over the symmetric group. In the work below, we characterize admissible pinnacle sets and study various enumerative questions related to these objects.

Recommendations

• Pinnacle sets of signed permutations
• Pinnacle set properties
• Admissible pinnacle orderings
• Further results on pinnacle sets
• Permutations with given peak set

Cites work

• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• A Mackey formula in the group of a Coxeter group. With an appendix by J. Tits: Two properties of Coxeter complexes
• A decomposition of Solomon's descent algebra
• A proof of the peak polynomial positivity conjecture
• Actions on permutations and unimodality of descent polynomials
• Asymptotics of Stirling Numbers of the Second Kind
• Average values of some Z-parameters in a random set partition
• Coefficients and roots of peak polynomials
• Combinatorial Hopf algebras, noncommutative Hall-Littlewood functions, and permutation tableaux
• Counting descents, rises, and levels, with prescribed first element, in words
• Denert's Permutation Statistic Is Indeed Euler‐Mahonian
• New results on the peak algebra.
• Peak quasisymmetric functions and Eulerian enumeration
• Permutation statistics related to a class of noncommutative symmetric functions and generalizations of the Genocchi numbers
• Permutation tableaux and permutation patterns
• Permutations with given peak set
• The excedance set of a permutation
• The peak algebra of the symmetric group
• The peak algebra of the symmetric group revisited.
• Yet another triangle for the Genocchi numbers

Cited in

(17)

• A characterization of one-element commutation classes
• Pinnacle set properties
• Pinnacle sets of signed permutations
• Admissible pinnacle orderings
• The number of permutations with the same peak set for signed permutations
• Further results on pinnacle sets
• Permutations with given peak set
• Efficient recurrence for the enumeration of permutations with fixed pinnacle set
• Sorting permutations with fixed pinnacle set
• Peaks are preserved under run-sorting
• A formula for enumerating permutations with a fixed pinnacle set
• Counting peaks on graphs
• Special values of spectral zeta functions and combinatorics: Sturm-Liouville problems
• Metrics on permutations with the same peak set
• Descent polynomials
• Pinnacle sets revisited
• Value-peaks of permutations

This page was built for publication: The pinnacle set of a permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783643)