Representing Permutations with Few Moves

DOI10.1137/15M1036105zbMath1347.05002arXiv1508.03674OpenAlexW2962792295MaRDI QIDQ2827490

Sergey Pupyrev, Lev Nachmanson, Alexander E. Holroyd, Sergey Bereg

Publication date: 20 October 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

permutationgraph drawingpermutation patternreduced wordpermutation diagram

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

The complexity of finding tangles, Computing height-optimal tangles faster

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Patterns in permutations and words.
• Sorting in \(c \log n\) parallel steps
• Proof of a conjecture of Burr, Grünbaum, and Sloane
• Some combinatorial properties of Schubert polynomials
• On the fully commutative elements of Coxeter groups
• The Yang-Baxter equation, symmetric functions, and Schubert polynomials
• Random sorting networks
• Drawing Permutations with Few Corners
• Improving Layered Graph Layouts with Edge Bundling
• Edge Routing with Ordered Bundles
• Ringing the Cosets
• RC-Graphs and Schubert Polynomials
• Cell Growth Problems
• Sorting a bridge hand