DeepAI AI Chat
Log In Sign Up

Sorting Permutations with Fixed Pinnacle Set

by   Irena Rusu, et al.
University of Nantes

We give a positive answer to a question raised by Davis et al. ( Discrete Mathematics 341, 2018), concerning permutations with the same pinnacle set. Given π∈ S_n, a pinnacle of π is an element π_i (i≠ 1,n) such that π_i-1<π_i>π_i+1. The question is: given π,π'∈ S_n with the same pinnacle set S, is there a sequence of operations that transforms π into π' such that all the intermediate permutations have pinnacle set S? We introduce balanced reversals, defined as reversals that do not modify the pinnacle set of the permutation to which they are applied. Then we show that π may be sorted by balanced reversals (i.e. transformed into a standard permutation _S), implying that π may be transformed into π' using at most 4n-2min{p,3} balanced reversals, where p=|S|≥ 1. In case p=0, at most 2n-1 balanced reversals are needed.


page 1

page 2

page 3

page 4


On the complexity of finding well-balanced orientations with upper bounds on the out-degrees

We show that the problem of deciding whether a given graph G has a well-...

Sorting by Prefix Block-Interchanges

We initiate the study of sorting permutations using prefix block-interch...

Learning Representations of Sets through Optimized Permutations

Representations of sets are challenging to learn because operations on s...

Algorithms for the Generalized Poset Sorting Problem

We consider a generalized poset sorting problem (GPS), in which we are g...

On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation

In this paper, we determine the 4-adic complexity of the balanced quater...

Visual High Dimensional Hypothesis Testing

In exploratory data analysis of known classes of high dimensional data, ...