Sorting permutations with fixed pinnacle set

DOI10.37236/9231MaRDI QIDQ785571zbMATH OpenOpenAlexFDO

Authors Irena Rusu

Publication date 7 August 2020

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

balanced reversals

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

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

Review text

Summary: We give a positive answer to a question raised by \textit{R. Davis} et al. [Discrete Math. 341, No. 11, 3249--3270 (2018; Zbl 1395.05002)], concerning permutations with the same \(\pi_{i-1}<\pi_i>\pi_{i+1}\). The question is: given \(\pi,\pi^\prime\in S_n\) with the same pinnacle set \(S\), is there a sequence of operations that transforms \(\pi\) into \(\pi'\) 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 \(\pi\) may be sorted by balanced reversals (i.e. transformed into a standard permutation \(Id_S)\), implying that \(\pi\) may be transformed into \(\pi^\prime\) using at most \(4n-2\min\{p,3\}\) balanced reversals, where \(p=|S|\geq 1\). In case \(p=0\), at most \(2n-1\) balanced reversals are needed.

Recommendations

• A formula for enumerating permutations with a fixed pinnacle set
• Pinnacle set properties
• Pinnacle sets of signed permutations
• The pinnacle set of a permutation
• Admissible pinnacle orderings

Cites work

• \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges
• A proof of the peak polynomial positivity conjecture
• Counting descents, rises, and levels, with prescribed first element, in words
• Efficient data structures and a new randomized approach for sorting signed permutations by reversals
• New results on the peak algebra.
• Peak quasisymmetric functions and Eulerian enumeration
• Permutations with given peak set
• The pinnacle set of a permutation
• Value-peaks of permutations

Cited in

(9)

• A formula for enumerating permutations with a fixed pinnacle set
• Admissible pinnacle orderings
• Pinnacle set properties
• Further results on pinnacle sets
• Permutations with given peak set
• Pinnacle sets of signed permutations
• Efficient recurrence for the enumeration of permutations with fixed pinnacle set
• Log-concavity and log-convexity via distributive lattices
• Pinnacles for complex reflection groups

This page was built for publication: Sorting permutations with fixed pinnacle set

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