Year: 2026
Type: article
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.
DOI: 10.37236/15260
Authors: Ron M. Adin, Eli Bagno, Yuval Roichman
Institutions: Bar-Ilan University, Jerusalem College of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7125170927