{
  "id": "1011.3661",
  "version": "v2",
  "published": "2010-11-16T11:43:55.000Z",
  "updated": "2012-03-20T09:28:21.000Z",
  "title": "A determinant formula for the Jones polynomial of pretzel knots",
  "authors": [
    "Moshe Cohen"
  ],
  "comment": "19 pages, 12 figures, 2 tables",
  "journal": "Journal of Knot Theory and Its Ramifications vol. 21, no. 6 (2012) 1250062 (23 pages)",
  "doi": "10.1142/S0218216512500629",
  "categories": [
    "math.GT",
    "math.CO"
  ],
  "abstract": "This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte's activity letters that arise because the Jones polynomial is a specialization of the signed version of the Tutte polynomial. The relationship is formalized between the familiar spanning tree setting for the Tait graph and the perfect matchings of the plane bipartite graph above. Evaluations of these activity words are related to the chain complex for the Champanerkar-Kofman spanning tree model of reduced Khovanov homology.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2012-03-20T09:28:21.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M25",
      "57M27",
      "57M15",
      "05C31",
      "05C05",
      "05C10",
      "05C22",
      "05C70"
    ],
    "keywords": [
      "jones polynomial",
      "determinant formula",
      "plane bipartite graph",
      "perfect matchings",
      "champanerkar-kofman spanning tree model"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1011.3661C"
    }
  }
}