Showing 2024Show all
3 papers · 1 filter
math.GT2024
The unknotting number, hard unknot diagrams, and reinforcement learning
Taylor Applebaum, Sam Blackwell, Alex Davies +5
We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upp…
math.GT2024
Some fast algorithms for curves in surfaces
Marc Lackenby
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two proper…
math.GT2024
Bounds for the number of moves between pants decompositions, and between triangulations
Marc Lackenby, Mehdi Yazdi
Given two pants decompositions of a compact orientable surface , we give an upper bound for their distance in the pants graph that depends logarithmically on their intersection…