{
  "id": "1104.1882",
  "version": "v2",
  "published": "2011-04-11T08:55:13.000Z",
  "updated": "2011-06-20T08:59:59.000Z",
  "title": "An upper bound on Reidemeister moves",
  "authors": [
    "Alexander Coward",
    "Marc Lackenby"
  ],
  "comment": "40 pages, 14 figures; v2: very minor changes",
  "categories": [
    "math.GT"
  ],
  "abstract": "We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2011-06-20T08:59:59.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M25",
      "57N10"
    ],
    "keywords": [
      "reidemeister moves",
      "explicit upper bound",
      "conceptually simple solution",
      "equivalence problem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 40,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1104.1882C"
    }
  }
}