Maximal admissible faces and asymptotic bounds for the normal surface solution space (Q2431613): Difference between revisions

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

Revision as of 23:01, 3 July 2024

scientific article
Language Label Description Also known as
English
Maximal admissible faces and asymptotic bounds for the normal surface solution space
scientific article

    Statements

    Maximal admissible faces and asymptotic bounds for the normal surface solution space (English)
    0 references
    0 references
    15 April 2011
    0 references
    The present paper deals with the use of normal surface theory in 3-dimensional computational topology: see \textit{H. Kneser}'s foundational paper [``Geschlossene Flächen in dreidimensionalen Mannigfaltigkeiten'', Jahresbericht D. M. V. 38, 248--260 (1929; JFM 55.0311.03)], together with the developments by Haken and Jaco-Oertel [\textit{W. Haken}, ``Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten'', Acta Math. 105, 245--375 (1961; Zbl 0100.19402), ``Über das Homöomorphieproblem der 3-Mannigfaltigkeiten. I'', Math. Z. 80, 89--120 (1962; Zbl 0106.16605), \textit{W. Jaco} and \textit{U. Oertel}, ``An algorithm to decide if a 3-manifold is a Haken manifold'', Topology 23, 195-209 (1984; Zbl 0545.57003)]. In particular, the author faces the crucial problem of enumerating normal surfaces in a given (triangulated) 3-manifold, via the underlying procedure of enumerating admissible vertices of a high-dimensional polytope (admissibility being a powerful but non-linear and non-convex constraint). The main results of the present paper are significant improvements upon the best known asymptotic bounds on the number of admissible vertices (see [\textit{J. Hass, J. C. Lagarias} and \textit{N. Pippenger}, [``The computational complexity of knot and link problems'', J. ACM 46, No. 2, 185--211 (1999; Zbl 1065.68667)], [\textit{B. A. Burton}, ``The complexity of the normal surface solution space'', in: SCG'10: Proceedings of the Twenty-Sixth Annual Symposium on Computational Geometry, ACM Press, pp. 201--209 (2010) and ``Optimizing the double description method for normal surface enumeration'', Math. Comput. 79, No. 269, 453--484 (2010; Zbl 1246.57038)]). To achieve these results, the author examines the layout of admissible points within polytopes in both the standard normal surface coordinate system and the streamlined quadrilateral coordinate system. These points are proved to correspond to well-behaved substructures of the face lattice, and the properties of the corresponding ``admissible faces'' are studied. Key lemmata include upper bounds on the number of maximal admissible faces of each dimension, and a bijection between the maximal admissible faces in the two coordinate systems mentioned above.
    0 references
    3-manifolds
    0 references
    normal surfaces
    0 references
    polytopes
    0 references
    face lattice
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references