A practical algorithm for knot factorisation

DOI10.4230/LIPICS.SOCG.2025.55MaRDI QIDQ7312702zbMATH OpenFDO

Authors Alexander He, Eric Sedgwick, Jonathan Spreer

Publication date 11 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2025.55

Mathematics Subject Classification ID

Computational methods for problems pertaining to manifolds and cell complexes (57-08) Knot theory (57K10)

Cites work

• 0-efficient triangulations of 3-manifolds
• A new approach to crushing 3-manifold triangulations
• Algorithms for the complete decomposition of a closed 3-manifold
• Computational topology with Regina: algorithms, heuristics and implementations
• Computing a link diagram from its exterior
• Converting between quadrilateral and standard solution sets in normal surface theory
• Discrete Morse theory for manifolds with boundary
• Finding large counterexamples by selectively exploring the Pachner graph
• Geometric triangulations and the Teichmüller TQFT volume conjecture for twist knots
• Knots in collapsible and non-collapsible balls
• Knottedness is in NP, modulo GRH
• On the complexity of torus knot recognition
• Recognition of Seifert fibered spaces with boundary is in NP
• Sampling Triangulations of Manifolds Using Monte Carlo Methods
• Sphere recognition lies in NP
• The computational complexity of classical knot recognition
• The computational complexity of knot and link problems
• The computational complexity of knot genus and spanning area
• The efficient certification of knottedness and Thurston norm
• The Next 350 Million Knots
• Unshellable triangulations of spheres

This page was built for publication: A practical algorithm for knot factorisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312702)