Admissible Pinnacle Orderings

A pinnacle of a permutation is a value that is larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work that characterized admissible pinnacle sets of permutations. For these sets, there can be specific orderings of the pinnacles that are not ad...

Full description

Saved in:
Bibliographic Details
Published inGraphs and combinatorics Vol. 37; no. 4; pp. 1205 - 1214
Main Authors Rusu, Irena, Tenner, Bridget Eileen
Format Journal Article
LanguageEnglish
Published Tokyo Springer Japan 01.07.2021
Springer Nature B.V
Springer Verlag
Subjects
Combinatorics
Computer Science
Engineering Design
Mathematics
Mathematics and Statistics
Original Paper
Peaks (landforms)
Permutations
Permutations
Combinatorial problems
Primary 05A05
05A18
Words
Online AccessGet full text

Cover

More Information
Summary:A pinnacle of a permutation is a value that is larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work that characterized admissible pinnacle sets of permutations. For these sets, there can be specific orderings of the pinnacles that are not admissible, meaning that they are not realized by any permutation. Here we characterize admissible orderings, using the relationship between a pinnacle x and its rank in the pinnacle set to bound the number of times that the pinnacles less than or equal to x can be interrupted by larger values.
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-021-02306-9