Unsolvable problems about higher-dimensional knots and related groups
Group Theory
2009-08-28 v1
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.
Cite
@article{arxiv.0908.4009,
title = {Unsolvable problems about higher-dimensional knots and related groups},
author = {F. Gonzalez-Acuna and C. McA. Gordon and J. Simon},
journal= {arXiv preprint arXiv:0908.4009},
year = {2009}
}
Comments
20 pages, AMSLaTeX, accepted for publication in L'Enseignement Mathematique