Mathematics > Combinatorics
arXiv:2601.12597 (math)
[Submitted on 18 Jan 2026 (v1), last revised 3 Sep 2026 (this version, v2)]
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.
Submission history
From: Ron M. Adin [view email]
[v1]
Sun, 18 Jan 2026 21:42:50 UTC (16 KB)
[v2]
Thu, 3 Sep 2026 12:33:19 UTC (18 KB)
Current browse context:
math.CO
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.