Metraipolis › archive › dc_d7f89248f950
Computations of the slice genus and the unknotting number of links via machine learning — arXiv:2610.10206
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10206
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:37:25.719Z
- SHA-256 of the archived text
1ba9d203126d2e14566fe223de766209fc44b97caec22ddd70d1098c6889c978- Stable URL of this page
https://metraipolis.com/documento/dc_d7f89248f950
How to cite
Computations of the slice genus and the unknotting number of links via machine learning — arXiv:2610.10206 — arXiv (en), https://arxiv.org/abs/2610.10206 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d7f89248f950 (Metraipolis archive dc_d7f89248f950, sha256 1ba9d203126d2e14566fe223de766209fc44b97caec22ddd70d1098c6889c978)
BibTeX
@misc{dcd7f89248f950,
title = {Computations of the slice genus and the unknotting number of links via machine learning — arXiv:2610.10206},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10206},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d7f89248f950; sha256 1ba9d203126d2e14566fe223de766209fc44b97caec22ddd70d1098c6889c978},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10206. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Links are disjoint unions of circles smoothly embedded in $S^3$. We use reinforcement learning and Bayesian optimisation to obtain new upper bounds on several link invariants that are not known to be algorithmically computable: the slice genus and the unknotting number for links, and the strong slice genus for algebraically split links. We also compute lower bounds using known invariants. Combining the upper and lower bounds, we obtain new exact values in many cases. Our unknotting agents can reproduce the non-additivity of the unknotting number for several counterexamples due to Brittenham and Hermiller, in some cases finding new unknotting trajectories. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Geometric Topology (math.GT) ; Machine Learning (cs.LG); Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2610.10206 — 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-08T12:14:15.454Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).