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 Edit this on Wikidata


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




Cites Work


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)