# Representing Permutations with Few Moves

@article{Bereg2016RepresentingPW,
title={Representing Permutations with Few Moves},
author={Sergey Bereg and Alexander E. Holroyd and Lev Nachmanson and Sergey Pupyrev},
journal={SIAM J. Discret. Math.},
year={2016},
volume={30},
pages={1950-1977}
}
• S. Bereg, +1 author S. Pupyrev
• Published 14 August 2015
• Mathematics, Computer Science
• SIAM J. Discret. Math.
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i to be a maximal subsequence of at least two consecutive permutations during which its positions form an arithmetic progression of common difference +1 or -1. We prove that for any initial and final permutations, there is a tangle connecting them in which each…
Computing Optimal Tangles Faster
• Mathematics, Computer Science
ArXiv
• 2019
An algorithm is given that computes an optimal tangle for $n$ wires and a given list of swaps in $O(n!\varphi^n)$ time, where $\varphi \approx 1.618$ is the golden ratio.
Computing Height-Optimal Tangles Faster
• Computer Science, Mathematics
Graph Drawing
• 2019
An algorithm is given that can treat lists where every swap occurs at most once in $O(n!\varphi^n)$ time and implemented the algorithm for the general case and compared it to an existing algorithm.
The Complexity of Finding Tangles
• Mathematics, Computer Science
ArXiv
• 2020
It is shown that it is even NP-hard to decide if a realizing tangle exists, which means that each pair of wires changes its order exactly as many times as specified by $L$.
Graph Drawing and Network Visualization: 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings
• Computer Science
Graph Drawing
• 2019
The value and uses of interaction for visualization are outlined, focusing on recent challenges and opportunities that have arisen, with a specific emphasis on graph and network visualizations.

## References

SHOWING 1-10 OF 26 REFERENCES
Sorting a bridge hand
• Computer Science, Mathematics
Discret. Math.
• 2001
A complete answer to the optimal sorting problem of a permutation of length n in at most 3n/4 moves is given, namely [(n + 1)/2].
Drawing Permutations with Few Corners
• Mathematics, Computer Science
Graph Drawing
• 2013
This work addresses the problem of minimizing the number of crossings together with theNumber of corners of the paths, focusing on classes of permutations in which both can be minimized simultaneously.
Patterns in Permutations and Words
• S. Kitaev
• Mathematics, Computer Science
Monographs in Theoretical Computer Science. An EATCS Series
• 2011
The author collects the main results in the field in this up-to-date, comprehensive reference volume and highlights significant achievements in the area, and points to research directions and open problems.
Compositions of pattern restricted sets of permutations
The composition of two pattern restricted classes X,Y is the set of all permutation products θφ where θ ∈ X,φ ∈ Y . This set is also defined by pattern restrictions. Examples are given where this set
Enumerative combinatorics
This review of 3 Enumerative Combinatorics, by Charalambos A.good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations.
Enumerative Combinatorics: Volume 1
Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of
RC-Graphs and Schubert Polynomials
• Mathematics, Computer Science
Exp. Math.
• 1993
A new set of diagrams that encode the Schubert polynomials are introduced using a formula of Billey, Jockusch and Stanley, Fomin and Kirillov and a new proof of Monk’s rule is given using an insertion algorithm on rc-graphs.
Random sorting networks
• Mathematics
• 2007
Abstract A sorting network is a shortest path from 12 ⋯ n to n ⋯ 21 in the Cayley graph of S n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n → ∞ the
On the number of arrangements of pseudolines
• S. Felsner
• Computer Science, Mathematics
SCG '96
• 1996
The vector (τ1, τ2, ..., τ_n) is shown to be an encoding for the arrangement of n pseudolines in the Euclidean plane.
Sorting inc logn parallel steps
• Mathematics
• 1983
We give a sorting network withcn logn comparisons. The algorithm can be performed inc logn parallel steps as well, where in a parallel step we comparen/2 disjoint pairs. In thei-th step of the