{
  "id": "1604.08386",
  "version": "v1",
  "published": "2016-04-28T12:16:31.000Z",
  "updated": "2016-04-28T12:16:31.000Z",
  "title": "New presentations of a link and virtual link",
  "authors": [
    "Liangxia Wan"
  ],
  "categories": [
    "math.GT"
  ],
  "abstract": "New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used to reduce the number of crossings in a link and virtual link. For known unknots, one can transform them into a trivial knot in a polynomial time by applying corresponding algorithm. As special consequences, two examples are given which are Goeritz's unknot and Thistlethwaite's unknot.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-04-28T12:16:31.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M27",
      "57M15"
    ],
    "keywords": [
      "virtual link",
      "presentations",
      "algebraic systems",
      "reduction crossing algorithms",
      "goeritzs unknot"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}