Conjugating full cycles by adjacent transpositions: diameter and sorting time
arXiv:2601.12597
Abstract
We establish upper and lower bounds on the maximal number of steps needed to transform a cyclic permutation to the canonical cyclic permutation using conjugation by adjacent transpositions, and on the diameter of the underlying Schreier graph.
12 pages, minor changes; to appear in Electron. J. Comb