Unsolvable problems about higher-dimensional knots and related groups
classification
🧮 math.GR
keywords
classgroupsunsolvablealgorithmicallybelongsclassescodimensioncomplements
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.