Conjugating Full Cycles by Adjacent Transpositions: Diameter and Sorting Time

  • Ron M. Adin
  • Eli Bagno
  • Yuval Roichman
DOI: https://doi.org/10.37236/15260

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.

Published
2026-10-23
How to Cite
Adin, R. M., Bagno, E., & Roichman, Y. (2026). Conjugating Full Cycles by Adjacent Transpositions: Diameter and Sorting Time. The Electronic Journal of Combinatorics, 33(4), #P4.14. https://doi.org/10.37236/15260
Issue
Volume 33, Issue 4 (2026)
Article Number
P4.14