Computations of the slice genus and the unknotting number of links via machine learning
math.GT, cs.LG, stat.ML
Submitted: 2026-10-07
Updated: 2026-10-07
Comments: 72 pages, 34 figures
Code: https://github.com/andras-juhasz/slice-genus-unknotting-rl
Project page: https://www.maths.dur.ac.uk/users/dirk.schuetz/knotjob.html
License: http://creativecommons.org/licenses/by/4.0/
The gist: Links are disjoint unions of circles smoothly embedded in S cubed.
Abstract
Links are disjoint unions of circles smoothly embedded in S cubed. 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.
Sources
- The unknotting number, hard unknot diagrams, and reinforcement learning
- Unknotting number is not additive under connected sum
- Unknotting number and connected sums: The knots $4_1$ and $5_1$
- A Fast, Strong, Topologically Meaningful and Fun Knot Invariant
- Ribbon concordances and slice obstructions: experiments and examples
- Fibered knots and potential counterexamples to the Property 2R and Slice-Ribbon Conjectures
- Learning to Unknot
- Searching for ribbons with machine learning
- A neural network approach to predicting and computing knot invariants
- Integer Knot Invariants: Inequalities, Computations, and Open Problems
- Deep Learning the Hyperbolic Volume of a Knot
- Special alternating links of minimal unlinking number
- Efficient calculations of $S$-invariants for links