Metraipolis › archive › dc_e00d9fedadd9
Hamilton Starters and Path Decompositions in Directed Circulants — arXiv:2609.01256
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01256
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T07:06:22.871Z
- SHA-256 of the archived text
fdceeabf819b62fcc605ffa7f278c66e4799165416eacd2dca61194d0c8558dd- Stable URL of this page
https://metraipolis.com/documento/dc_e00d9fedadd9
How to cite
Hamilton Starters and Path Decompositions in Directed Circulants — arXiv:2609.01256 — arXiv (en), https://arxiv.org/abs/2609.01256 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e00d9fedadd9 (Metraipolis archive dc_e00d9fedadd9, sha256 fdceeabf819b62fcc605ffa7f278c66e4799165416eacd2dca61194d0c8558dd)
BibTeX
@misc{dce00d9fedadd9,
title = {Hamilton Starters and Path Decompositions in Directed Circulants — arXiv:2609.01256},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01256},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e00d9fedadd9; sha256 fdceeabf819b62fcc605ffa7f278c66e4799165416eacd2dca61194d0c8558dd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01256. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For integers q at least 3 and r at least 1, consider the directed Cayley graph on the cyclic group of order qr whose allowed steps are the integers from 1 through r. A Hamilton cycle H is called a q-layer balanced Hamilton starter if, for every step from 1 through r and every residue class modulo q, H contains exactly one arc of that step whose tail belongs to the given residue class. The r translates of H by successive multiples of q then form a Hamilton decomposition of the digraph. A q-layer balanced Hamilton starter is called chain-compatible if one arc can be selected from each Hamilton cycle in this decomposition so that the selected arcs form a simple directed path. In both constructions, the compatible deletion chain is the arithmetic step-2 path beginning at 0 and ending at 2r. For q equal to 4, a chain-compatible starter is obtained explicitly whenever r is congruent to 1 modulo 4 and r is at least 9, while for q equal to 3 one exists for all sufficiently large r congruent to 5 modulo 6. The proofs are constructive: the four-layer case uses an ABAB step word, while in the three-layer case a directed rotational terrace is lifted to a 3-layer balanced directed 1-factor and a fixed four-arc trade joins its two cycles. Deleting the unique prescribed-path arc from each translated Hamilton cycle gives r Hamilton paths; together with the prescribed path, these form an optimal decomposition of the arc set into r+1 directed paths in both cases. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.01256 — 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-17T06:52:59.690Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).