Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 2 min ago
Peer-reviewedCC BY 4.0The Electronic Journal of Combinatorics

Conjugating Full Cycles by Adjacent Transpositions: Diameter and Sorting Time

  • Ron M. Adin
  • Eli Bagno
  • Yuval Roichman
Open at sourcePDFDOICite

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.

Related

  1. Twisted Bracelets for Sorting by Transpositions: the Transposition Diameter of S16
    Luiz A. G. Silva, Luis A. B. Kowada, Noraí R. Rocco +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Concatenation Locality under Successive Adjacent Transpositions
    Adelin Ataba, Aryeh Lev Zabokritskiy
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Type C transpositions and strong marked tableaux
    Yaozhou Fang, Xing Gao
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Finite Orders of Products of Two Class Transpositions Divide 840
    Alex Iskra
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Restricted monodromy containing transpositions
    Julianne Barnhart, Taylor Brysiewicz, Michael Burr +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv

Cite

BibTeXRIS
BibTeX
@article{adin2026conjugating,
  title = {{Conjugating Full Cycles by Adjacent Transpositions: Diameter and Sorting Time}},
  author = {Ron M. Adin and Eli Bagno and Yuval Roichman},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  month = oct,
  doi = {10.37236/15260},
  url = {https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p14},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Conjugating Full Cycles by Adjacent Transpositions: Diameter and Sorting Time
AU  - Ron M. Adin
AU  - Eli Bagno
AU  - Yuval Roichman
PY  - 2026
DA  - 2026/10/23
JO  - The Electronic Journal of Combinatorics
DO  - 10.37236/15260
UR  - https://www.combinatorics.org/ojs/index.php/eljc/article/view/v33i4p14
AB  - 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.
SN  - 1077-8926
ER  -