Computing a link diagram from its exterior
From MaRDI portal
Publication:6145673
DOI10.1007/S00454-023-00533-WarXiv2112.03251OpenAlexW4385480884MaRDI QIDQ6145673FDOQ6145673
Authors: Nathan M. Dunfield, Malik Obeidin
Publication date: 9 January 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Abstract: A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by planar diagrams, whereas their exteriors, which are compact 3-manifolds with torus boundary, are encoded by triangulations. Here, we give the first practical algorithm for finding a diagram of a knot given a triangulation of its exterior. Our method applies to links as well as knots, allows us to recover links with hundreds of crossings. We use it to find the first diagrams known for 23 principal congruence arithmetic link exteriors; the largest has over 2,500 crossings. Other applications include finding pairs of knots with the same 0-surgery, which relates to questions about slice knots and the smooth 4D Poincar'e conjecture.
Full work available at URL: https://arxiv.org/abs/2112.03251
Recommendations
computational topologylink diagramknotknot diagramlinklow-dimensional topologyknot exteriorlink exterior
Cites Work
- Title not available (Why is that?)
- Knots are Determined by Their Complements
- On the Braid Index of Alternating Links
- On the computational complexity of the Jones and Tutte polynomials
- FAST KHOVANOV HOMOLOGY COMPUTATIONS
- Simple Knots in Compact, Orientable 3-Manifolds
- P.l. homeomorphic manifolds are equivalent by elementary shellings
- Normal surfaces in topologically finite 3-manifolds
- The first 1,701,936 knots
- Decision problems in the space of Dehn fillings
- 0-efficient triangulations of 3-manifolds
- Computational topology with Regina: algorithms, heuristics and implementations
- Title not available (Why is that?)
- Triple crossing number of knots and links
- Arc-presentations of links: Monotonic simplification
- Algorithmic topology and classification of 3-manifolds
- The 500 simplest hyperbolic knots
- The computational complexity of knot and link problems
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Energy of a knot
- Sphere recognition lies in NP
- Title not available (Why is that?)
- Convex hulls and isometries of cusped hyperbolic 3-manifolds
- Man and machine thinking about the smooth 4-dimensional Poincaré conjecture
- Alternating links and definite surfaces
- Integer homology 3-spheres admit irreducible representations in \(\mathrm{SL}(2,{\mathbb C})\)
- Title not available (Why is that?)
- Inflations of ideal triangulations
- Computation of hyperbolic structures in knot theory
- Title not available (Why is that?)
- Three-page approach to knot theory. Encoding and local moves
- The computational complexity of basic decision problems in 3-dimensional topology
- Simplifying triangulations of \(S^3\).
- ENERGY FUNCTIONS FOR POLYGONAL KNOTS
- A characterisation of alternating knot exteriors
- The Weber-Seifert dodecahedral space is non-Haken
- The Conway knot is not slice
- Algorithmic homeomorphism of 3-manifolds as a corollary of geometrization
- The rate of growth of the number of prime alternating links and tangles
- Symmetries, Isometries and Length Spectra of Closed Hyperbolic Three-Manifolds
- Monopole Floer homology, eigenform multiplicities, and the Seifert-Weber dodecahedral space
- The Next 350 Million Knots
- Isometric cusps in hyperbolic \(3\)-manifolds
- The Pachner graph and the simplification of 3-sphere triangulations
- Bordered knot algebras with matchings
- A fast algorithm for calculating \(s\)-invariants
- A census of exceptional Dehn fillings
- All principal congruence link groups
- Connectivity of triangulations without degree one edges under 2-3 and 3-2 moves
- Topological descriptions of protein folding
- The unbearable hardness of unknotting
- Multiflypes of rectangular diagrams of links
- Title not available (Why is that?)
- From zero surgeries to candidates for exotic definite 4‐manifolds
Cited In (1)
This page was built for publication: Computing a link diagram from its exterior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145673)