Circular sorting
arXiv:2502.14398
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.
16 pages, minor changes, one reference added. To appear in the Israel Journal of Mathematics