Markov's theorem and algorithmically non-recognizable combinatorial manifolds

DOI10.1070/IM2004v068n01ABEH000471zbMath1069.57013OpenAlexW2081200428MaRDI QIDQ4674631

M. A. Shtan'ko

Publication date: 17 May 2005

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im2004v068n01abeh000471

zbMATH Keywords

combinatorial manifoldregular neighborhoodinsoluble word problemalgorithmically non-recognizable manifoldhandle theory

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Polyhedral manifolds (52B70) Comparison of PL-structures: classification, Hauptvermutung (57Q25) Regular neighborhoods in PL-topology (57Q40)

Related Items (9)

Computing on Lattice-Ordered Abelian Groups ⋮ Recognizing free generating sets of \(\ell\)-groups ⋮ Idempotent endomorphisms of free MV-algebras and unital \(\ell\)-groups ⋮ On the homeomorphism problem for 4-manifolds ⋮ Fans, decision problems and generators of free abelian \(\ell\)-groups ⋮ Complete and computable orbit invariants in the geometry of the affine group over the integers ⋮ Balanced presentations of the trivial group and four-dimensional geometry ⋮ A Geometric Approach to MV-Algebras ⋮ Questions in algebra and mathematical logic. Scientific heritage of S. I. Adian

This page was built for publication: Markov's theorem and algorithmically non-recognizable combinatorial manifolds