Indexed metadata
Conjugating Full Cycles by Adjacent Transpositions: Diameter and Sorting Time
Ron M. Adin, Eli Bagno, Yuval Roichman
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.