THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE

DOI10.1070/RM1974v029n05ABEH001296zbMath0311.57001MaRDI QIDQ4069522

V. E. Kuznetsov, A. T. Fomenko, I. A. Volodin

Publication date: 1974

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Fundamental groups and their automorphisms (group-theoretic aspects) (20F34) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) (S^{n-1}subset E^n), Schoenflies problem (57N50)

Related Items (37)

Extremal examples of collapsible complexes and random discrete Morse theory ⋮ Zeeman's conjecture for unthickened special polyhedra is equivalent to the Andrews-Curtis conjecture ⋮ On the homeomorphism problem for 4-manifolds ⋮ A note on a Heegaard diagram of \(S^ 3\) ⋮ Three-manifolds. Classical results ⋮ Signable posets and partitionable simplicial complexes ⋮ Non‐recursive functions, knots “with thick ropes,” and self‐clenching “thick” hyperspheres ⋮ Disconnectedness of sublevel sets of some Riemannian functionals ⋮ Geometry of the space of triangulations of a compact manifold ⋮ A note on irreducible Heegaard diagrams ⋮ Derived subdivisions make every PL sphere polytopal ⋮ Oriented matroid polytopes and polyhedral fans are signable ⋮ NP-Hardness of Computing PL Geometric Category in Dimension 2 ⋮ Hardness of embedding simplicial complexes in \(\mathbb R^d\) ⋮ \(h\)-cobordism and \(s\)-cobordism theorems: transfer over semialgebraic and Nash categories, uniform bound and effectiveness ⋮ PL Morse theory in low dimensions ⋮ Shellable tilings on relative simplicial complexes and their \(h\)-vectors ⋮ Exotic torus manifolds and equivariant smooth structures on quasitoric manifolds ⋮ Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\) ⋮ Classification of Heegaard diagrams of genus three ⋮ Nonrecursive functions in real algebraic geometry ⋮ Remarks on a paper of M. Ochiai ⋮ Recognition of collapsible complexes is NP-complete ⋮ Almost normal surfaces in 3-manifolds ⋮ Representing geometric structures in \(d\) dimensions: Topology and order ⋮ Hegaard diagrams and colored polyhedra ⋮ Realizability of polytopes as a low rank matrix completion problem ⋮ Unnamed Item ⋮ Invariant groups on equivalent crystallizations ⋮ Remarks on the entropy of \(3\)-manifolds ⋮ Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds ⋮ Einstein structures: Existence versus uniqueness ⋮ Frontiers of sphere recognition in practice ⋮ Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity ⋮ Gradient-like flows on 3-manifolds ⋮ Effectiveness - non effectiveness in semialgebraic and PL geometry ⋮ Graph-encoded 3-manifolds

This page was built for publication: THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE