{
  "id": "0808.2713",
  "version": "v1",
  "published": "2008-08-20T09:28:29.000Z",
  "updated": "2008-08-20T09:28:29.000Z",
  "title": "Recognizing trace graphs of closed braids",
  "authors": [
    "T. Fiedler",
    "V. Kurlin"
  ],
  "comment": "20 pages, 15 figures",
  "categories": [
    "math.GT",
    "math.AT"
  ],
  "abstract": "To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a fixed number of strands, we recognize trace graphs up to isotopy and trihedral moves in polynomial time with respect to the braid length.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-08-20T09:28:29.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M25"
    ],
    "keywords": [
      "closed braid",
      "recognizing trace graphs",
      "polynomial time",
      "braid length",
      "trihedral moves"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 20,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0808.2713F"
    }
  }
}