Metraipolis › archive › dc_ff12bf2606d5
Watkins's conjecture holds for all infinite groups — arXiv:2610.01049
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01049
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T17:42:02.670Z
- SHA-256 of the archived text
57ad6427784e456c5aadbfd768cd0aeae6d50912831edb29384f6b42bbde45d2- Stable URL of this page
https://metraipolis.com/documento/dc_ff12bf2606d5
How to cite
Watkins's conjecture holds for all infinite groups — arXiv:2610.01049 — arXiv (en), https://arxiv.org/abs/2610.01049 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ff12bf2606d5 (Metraipolis archive dc_ff12bf2606d5, sha256 57ad6427784e456c5aadbfd768cd0aeae6d50912831edb29384f6b42bbde45d2)
BibTeX
@misc{dcff12bf2606d5,
title = {Watkins's conjecture holds for all infinite groups — arXiv:2610.01049},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01049},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ff12bf2606d5; sha256 57ad6427784e456c5aadbfd768cd0aeae6d50912831edb29384f6b42bbde45d2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01049. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that at every infinite cardinality, every group which is neither abelian of exponent greater than two nor generalized dicyclic admits a graphical regular representation, settling the infinite-group part of Watkins's conjecture. We also determine the Cayley index of every infinite group: it is $1$, $2$, or $8$, according to its algebraic type, and in every case the index is attained by a connected Cayley graph. For every infinite group $G$ of cardinality $\kappa$, we construct $2^\kappa$ pairwise nonisomorphic Cayley graphs with exactly the unavoidable inverse-pair symmetries, diameter two, and $\kappa$ common neighbors at every distinct pair. The principal tool recovers a continuous ordinal hierarchy from an alternating adjacency baseline with bounded-degree errors: robust finite patterns identify the initial classes, successive twin quotients recover the layers, and their finite exception packets determine the translation action. The reconstruction applies without a group action and is stable under additional layerwise bounded-degree edits. Further results give closed Cantor-cube families with prescribed finite data in the regular cases, sharp cofinality-dependent graph properties, and optimal three-valued shortest-path metrics. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO). Categorie arXiv: Group Theory (math.GR) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2610.01049 — 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-06T16:06:55.903Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).