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.