Conjugating full cycles by adjacent transpositions: diameter and sorting time
Combinatorics
2026-01-21 v1
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.
Cite
@article{arxiv.2601.12597,
title = {Conjugating full cycles by adjacent transpositions: diameter and sorting time},
author = {Ron M. Adin and Eli Bagno and Yuval Roichman},
journal= {arXiv preprint arXiv:2601.12597},
year = {2026}
}
Comments
12 pages