The efficient certification of knottedness and Thurston norm

2021/06/15 by Marc Lackenby · 17 citations
Computer Science · Mathematics · #Combinatorics #Corollary #Geometric and Algebraic Topology #Homology (biology) #Homotopy and Cohomology in Algebraic Topology #Knot (papermaking) #Mathematics #Norm (philosophy) #Pure mathematics #Topological and Geometric Data Analysis

paper · open access · doi:10.1016/j.aim.2021.107796

published in Advances in Mathematics 387, 107796 (Elsevier BV)

openalex publication_date 2021/06/15 · crossref created 2021/06/15 · crossref issued 2021/08/01 · crossref published 2021/08/01 · crossref published-print 2021/08/01 · crossref deposited 2025/09/11 · openalex created_date 2025/10/10 · crossref indexed 2026/06/29 · openalex updated_date 2026/07/28

Citations

• Algorithms for the complete decomposition of a closed 3-manifold
• An algorithm to decide if a 3-manifold is a Haken manifold
• The computational complexity of knot and link problems
• On Irreducible 3-Manifolds Which are Sufficiently Large
• The crossing number of composite knots
• The number of Reidemeister moves needed for unknotting
• Theorie der Normalflächen: Ein Isotopiekriterium für den Kreisknoten
• Knottedness is in NP , modulo GRH

Cited by

• Braiding vineyards
• Unknotting problem [wikipedia]