Maximal admissible faces and asymptotic bounds for the normal surface solution space

DOI10.1016/j.jcta.2010.12.011zbMath1236.57028DBLPjournals/jct/Burton11arXiv1004.2605OpenAlexW1943781221WikidataQ30054769 ScholiaQ30054769MaRDI QIDQ2431613

Benjamin A. Burton

Publication date: 15 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

complexitypolytopesnormal surfaces3-manifoldsface lattice

Mathematics Subject Classification ID

Triangulating manifolds (57Q15) Topological manifolds (57N99) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04)

Related Items (1)

A tree traversal algorithm for decision problems in knot theory and 3-manifold topology

Uses Software

• SnapPea

Cites Work

• Complexity theory of three-dimensional manifolds
• Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
• Über das Homöomorphieproblem der 3-Mannigfaltigkeiten. I
• An algorithm to decide if a 3-manifold is a Haken manifold
• Normal surfaces in topologically finite 3-manifolds
• Converting between quadrilateral and standard solution sets in normal surface theory
• Normal surface \(Q\)-theory
• A new decomposition theorem for 3-manifolds
• 0-efficient triangulations of 3-manifolds
• Thin position and the recognition problem for \(S^ 3\)
• Algorithms for the complete decomposition of a closed \(3\)-manifold
• Quadrilateral–Octagon Coordinates for Almost Normal Surfaces
• The Weber-Seifert dodecahedral space is non-Haken
• The computational complexity of knot and link problems
• The Complexity of Vertex Enumeration Methods
• 3-manifold knot genus is NP-complete
• Optimizing the double description method for normal surface enumeration
• A census of cusped hyperbolic 3-manifolds
• Lectures on Polytopes
• FACE PAIRING GRAPHS AND 3-MANIFOLD ENUMERATION
• The complexity of the normal surface solution space
• The maximum numbers of faces of a convex polytope
• Generating all vertices of a polyhedron is hard
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal admissible faces and asymptotic bounds for the normal surface solution space