Autor:	Rusu, Irena, Tenner, Bridget Eileen
Rok vydání:	2020
Předmět:	Mathematics - Combinatorics Primary: 05A05 Secondary: 05A18
Druh dokumentu:	Working Paper
Popis:	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. Comment: to appear in Graphs and Combinatorics
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2001.08185 Zobrazit plný text záznamu View this record from Arxiv