{
  "id": "1210.2101",
  "version": "v1",
  "published": "2012-10-07T20:20:46.000Z",
  "updated": "2012-10-07T20:20:46.000Z",
  "title": "Recognizing geometric 3-manifold groups using the word problem",
  "authors": [
    "Daniel Groves",
    "Jason Fox Manning",
    "Henry Wilton"
  ],
  "comment": "30 pages",
  "categories": [
    "math.GR",
    "math.GT"
  ],
  "abstract": "Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed, geometric 3-manifolds is algorithmically recognizable. In our terminology, the class of geometric 3-manifold groups is `recursive modulo the word problem'.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-10-07T20:20:46.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "word problem",
      "recognizing geometric",
      "finite presentation",
      "fundamental groups"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 30,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1210.2101G"
    }
  }
}