{
  "id": "math/9903055",
  "version": "v1",
  "published": "1999-03-10T00:56:14.000Z",
  "updated": "1999-03-10T00:56:14.000Z",
  "title": "On the z-degree of the Kauffman polynomial of a tangle decomposition",
  "authors": [
    "Mark E. Kidwell",
    "Theodore B. Stanford"
  ],
  "comment": "9 Pages, 9 eps figures",
  "categories": [
    "math.GT",
    "math.QA"
  ],
  "abstract": "We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational tangles.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1999-03-10T00:56:14.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M25"
    ],
    "keywords": [
      "kauffman polynomial",
      "tangle decomposition",
      "link diagram",
      "upper bound",
      "length greater"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1999math......3055K"
    }
  }
}