Unsolvable problems about higher-dimensional knots and related groups
From MaRDI portal
Publication:993658
Abstract: We consider classes of fundamental groups of complements of various kinds of codimension 2 embeddings and show that, in general, the problem of deciding whether or not a group in one class belongs to a smaller class is algorithmically unsolvable.
Recommendations
- Algorithmic unsolvability of the triviality problem for multidimensional knots
- On the finiteness of higher knot sums
- scientific article; zbMATH DE number 1342334
- Unrecognizability of manifolds. On Novikov's theorem on the unrecognizability of the sphere \(\mathbb S^n\) for \(n\geq 5\)
- The conjugacy problem for knot groups
Cited in
(3)
This page was built for publication: Unsolvable problems about higher-dimensional knots and related groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993658)