arXiv (All)
open access
Computations of the slice genus and the unknotting number of links via machine learning
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 slic
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Machine Learning Classification of Prostate Cancer Genomic Sequences Using K-Mer and Sequence-Derived Features.#378432
- Motion groups, Legendrian links, and non-trivial loops of embeddings#1247731
- SPID: Distilled Protein Backbone Generation#1049683
- Localization and the Floer homology of strongly invertible knots#662347
- Localization and the Floer homology of strongly invertible knots#661297
Record · ID 1234573
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive