Circular sorting
Combinatorics
2025-08-07 v2
Abstract
We determine the maximal number of steps required to sort labeled points on a circle by adjacent swaps. Lower bounds for sorting by all swaps, not necessarily adjacent, are given as well.
Cite
@article{arxiv.2502.14398,
title = {Circular sorting},
author = {Ron M. Adin and Noga Alon and Yuval Roichman},
journal= {arXiv preprint arXiv:2502.14398},
year = {2025}
}
Comments
16 pages, minor changes, one reference added. To appear in the Israel Journal of Mathematics