How to make a triangulation of $S^3$ polytopal

DOI10.1090/S0002-9947-04-03465-8zbMath1045.52007arXivmath/0009216OpenAlexW1629823811MaRDI QIDQ4813860

Simon A. King

Publication date: 13 August 2004

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

shellabilityspherical triangulationpolytopalityRubinstein-Thompson algorithmedge contractibilityMorse embeddings

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Shellability for polytopes and polyhedra (52B22)

Related Items (3)

Complexity of triangulations of the projective space. ⋮ The size of triangulations supporting a given link ⋮ Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds

Cites Work

• Many triangulated spheres
• Unshellable triangulations of spheres
• Knots and shellable cell partitionings of \(S^ 3\)
• Complexity of triangulations of the projective space.
• The size of triangulations supporting a given link
• The size of spanning disks for polygonal curves
• Simplifying triangulations of \(S^3\).
• Affine structures in 3-manifolds. V: The triangulation theorem and Hauptvermutung
• Über eine numerische Knoteninvariante
• The d-Step Conjecture and Its Relatives
• Lectures on Polytopes
• CROSSING NUMBER OF LINKS FORMED BY EDGES OF A TRIANGULATION
• An algorithm for the recognition of 3-spheres (according to Thompson)
• Knots
• Non-constructible complexes and the bridge index

This page was built for publication: How to make a triangulation of $S^3$ polytopal