The size of triangulations supporting a given link

DOI10.2140/gt.2001.5.369zbMath1021.57005arXivmath/0007032OpenAlexW2142302131MaRDI QIDQ1810324

Simon A. King

Publication date: 16 June 2003

Published in: Geometry \& Topology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0007032

zbMATH Keywords

triangulationnormal surfacesbridge numberLinkRubinstein-Thompson algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Triangulating manifolds (57Q15)

Related Items

How to make a triangulation of $S^3$ polytopal, The computational complexity of knot genus in a fixed 3‐manifold, Complexity of triangulations of the projective space., TANGLE SUM AND CONSTRUCTIBLE SPHERES, The efficient certification of knottedness and Thurston norm, The size of triangulations supporting a given link, CROSSING NUMBER OF LINKS FORMED BY EDGES OF A TRIANGULATION

Cites Work

• Über das Homöomorphieproblem der 3-Mannigfaltigkeiten. I
• Foliations and the topology of 3-manifolds. III
• Unshellable triangulations of spheres
• Knots and shellable cell partitionings of \(S^ 3\)
• Decompositions of simplicial balls and spheres with knots consisting of few edges
• The size of triangulations supporting a given link
• Simplifying triangulations of \(S^3\).
• Thin position and the recognition problem for \(S^ 3\)
• The number of Reidemeister moves needed for unknotting
• Algorithmic recognition of 3-manifolds
• How to make a triangulation of $S^3$ polytopal
• An algorithm for the recognition of 3-spheres (according to Thompson)
• Knots
• Non-constructible complexes and the bridge index
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item