Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.14398 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911094104129536 |
|---|---|
| author | Adin, Ron M. Alon, Noga Roichman, Yuval |
| author_facet | Adin, Ron M. Alon, Noga Roichman, Yuval |
| contents | We determine the maximal number of steps required to sort $n$ labeled points on a circle by adjacent swaps. Lower bounds for sorting by all swaps, not necessarily adjacent, are given as well. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_14398 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Circular sorting Adin, Ron M. Alon, Noga Roichman, Yuval Combinatorics 05A05, 68P10 We determine the maximal number of steps required to sort $n$ labeled points on a circle by adjacent swaps. Lower bounds for sorting by all swaps, not necessarily adjacent, are given as well. |
| title | Circular sorting |
| topic | Combinatorics 05A05, 68P10 |
| url | https://arxiv.org/abs/2502.14398 |