THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
DOI10.1070/RM1974V029N05ABEH001296zbMATH Open0311.57001MaRDI QIDQ4069522FDOQ4069522
V. E. Kuznetsov, A. T. Fomenko, I. A. Volodin
Publication date: 1974
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Generators, relations, and presentations of groups (20F05) Fundamental groups and their automorphisms (group-theoretic aspects) (20F34) (S^{n-1}subset E^n), Schoenflies problem (57N50)
Cited In (38)
- Nonrecursive functions in real algebraic geometry
- Gradient-like flows on 3-manifolds
- 634 vertex-transitive and more than \(10^{103}\) non-vertex-transitive 27-vertex triangulations of manifolds like the octonionic projective plane
- \(h\)-cobordism and \(s\)-cobordism theorems: transfer over semialgebraic and Nash categories, uniform bound and effectiveness
- Oriented matroid polytopes and polyhedral fans are signable
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Title not available (Why is that?)
- Hegaard diagrams and colored polyhedra
- Zeeman's conjecture for unthickened special polyhedra is equivalent to the Andrews-Curtis conjecture
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- Representing geometric structures in \(d\) dimensions: Topology and order
- Effectiveness - non effectiveness in semialgebraic and PL geometry
- Remarks on the entropy of \(3\)-manifolds
- Almost normal surfaces in 3-manifolds
- A note on a Heegaard diagram of \(S^ 3\)
- Three-manifolds. Classical results
- Remarks on a paper of M. Ochiai
- Realizability of polytopes as a low rank matrix completion problem
- A note on irreducible Heegaard diagrams
- Derived subdivisions make every PL sphere polytopal
- Noncomputability arising in dynamical triangulation model of four- dimensional quantum gravity
- NP-Hardness of Computing PL Geometric Category in Dimension 2
- Extremal examples of collapsible complexes and random discrete Morse theory
- Graph-encoded 3-manifolds
- Signable posets and partitionable simplicial complexes
- Non‐recursive functions, knots “with thick ropes,” and self‐clenching “thick” hyperspheres
- Invariant groups on equivalent crystallizations
- PL Morse theory in low dimensions
- Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\)
- Disconnectedness of sublevel sets of some Riemannian functionals
- Einstein structures: Existence versus uniqueness
- Exotic torus manifolds and equivariant smooth structures on quasitoric manifolds
- Shellable tilings on relative simplicial complexes and their \(h\)-vectors
- Classification of Heegaard diagrams of genus three
- Recognition of collapsible complexes is NP-complete
- Frontiers of sphere recognition in practice
- Geometry of the space of triangulations of a compact manifold
- On the homeomorphism problem for 4-manifolds
This page was built for publication: THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4069522)