Conjugating full cycles by adjacent transpositions: diameter and sorting time
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909994373349376 |
|---|---|
| author | Adin, Ron M. Bagno, Eli Roichman, Yuval |
| author_facet | Adin, Ron M. Bagno, Eli Roichman, Yuval |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_12597 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Conjugating full cycles by adjacent transpositions: diameter and sorting time Adin, Ron M. Bagno, Eli Roichman, Yuval Combinatorics 05A05, 68P10 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. |
| title | Conjugating full cycles by adjacent transpositions: diameter and sorting time |
| topic | Combinatorics 05A05, 68P10 |
| url | https://arxiv.org/abs/2601.12597 |