{
  "id": "math/0203012",
  "version": "v1",
  "published": "2002-03-01T21:42:14.000Z",
  "updated": "2002-03-01T21:42:14.000Z",
  "title": "Random walks and the colored Jones function",
  "authors": [
    "Stavros Garoufalidis",
    "Martin Loebl"
  ],
  "comment": "AMS-LaTeX, 13 pages with 12 figures",
  "categories": [
    "math.GT",
    "math.QA"
  ],
  "abstract": "It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2002-03-01T21:42:14.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "colored jones function",
      "random walks",
      "weight system",
      "counting paths",
      "chord diagram"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2002math......3012G"
    }
  }
}