Metraipolis › archive › dc_504fd3690a42
Some results on Archdeacon's conjecture for rotation systems — arXiv:2609.11599
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11599
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:16:18.113Z
- SHA-256 of the archived text
730fbb810a6992f469e32cd3a77170c4c44e10d1fcc045b0371779eb20368166- Stable URL of this page
https://metraipolis.com/documento/dc_504fd3690a42
How to cite
Some results on Archdeacon's conjecture for rotation systems — arXiv:2609.11599 — arXiv (en), https://arxiv.org/abs/2609.11599 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_504fd3690a42 (Metraipolis archive dc_504fd3690a42, sha256 730fbb810a6992f469e32cd3a77170c4c44e10d1fcc045b0371779eb20368166)
BibTeX
@misc{dc504fd3690a42,
title = {Some results on Archdeacon's conjecture for rotation systems — arXiv:2609.11599},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11599},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_504fd3690a42; sha256 730fbb810a6992f469e32cd3a77170c4c44e10d1fcc045b0371779eb20368166},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11599. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO).
Categorie arXiv: Computational Geometry (cs.CG) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.11599 — 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-16T05:59:08.326Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).