Metraipolis › archive › dc_fbf58d2ad0f0

Cyclic Hamilton Cycle Decompositions of Carousel Tournaments of Order $pq$ — arXiv:2610.07102

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07102
License (as archived)
CC0-1.0
Archived
2026-10-07T11:53:02.626Z
SHA-256 of the archived text
8ebfb5f4d74f58a12c719cfaaa0c12f90ff61dfd0eaeb8d2ae48b77662e62b9c
Stable URL of this page
https://metraipolis.com/documento/dc_fbf58d2ad0f0

How to cite

Cyclic Hamilton Cycle Decompositions of Carousel Tournaments of Order $pq$ — arXiv:2610.07102 — arXiv (en), https://arxiv.org/abs/2610.07102 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fbf58d2ad0f0 (Metraipolis archive dc_fbf58d2ad0f0, sha256 8ebfb5f4d74f58a12c719cfaaa0c12f90ff61dfd0eaeb8d2ae48b77662e62b9c)
BibTeX
@misc{dcfbf58d2ad0f0,
  title = {Cyclic Hamilton Cycle Decompositions of Carousel Tournaments of Order $pq$ — arXiv:2610.07102},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07102},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fbf58d2ad0f0; sha256 8ebfb5f4d74f58a12c719cfaaa0c12f90ff61dfd0eaeb8d2ae48b77662e62b9c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07102. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Kelly's conjecture asks whether every regular tournament admits a Hamilton cycle decomposition. Motivated by its symmetry-preserving extension, we study cyclic Hamilton decompositions of carousel tournaments. For an odd integer $n$, let \[ T_n=\Cay\left( \mathbb Z_n,\left\{1,2,\ldots,\frac{n-1}{2}\right\} \right) \] be the carousel tournament. We ask whether $T_n$ has a Hamilton decomposition invariant under translation by $1$. Although the answer is immediate when $n$ is prime, composite orders introduce a genuine obstruction: nonunit differences generate short cycles rather than Hamilton cycles. We resolve a general composite-order family by proving that, whenever $n=pq$ for primes $7\le p<q$, the tournament $T_n$ admits a cyclic Hamilton cycle decomposition. The proof combines Hamiltonian difference sequences over prime fields with a matching argument that constructs two base paths with disjoint difference sets in $\mathbb Z_{pq}$. Thus our result gives an infinite family supporting the cyclic, symmetry-preserving extension of the Hamilton decomposition problem for regular tournaments.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.07102 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:22:09.531Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).