{
  "id": "1507.04088",
  "version": "v1",
  "published": "2015-07-15T05:26:11.000Z",
  "updated": "2015-07-15T05:26:11.000Z",
  "title": "A lower bound on minimal number of colors for links",
  "authors": [
    "Kazuhiro Ichihara",
    "Eri Matsudo"
  ],
  "comment": "7 pages",
  "categories": [
    "math.GT"
  ],
  "abstract": "We show that the minimal number of colors for all effective $n$-colorings of a link with non-zero determinant is at least $1+\\log_2 n$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-07-15T05:26:11.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M25"
    ],
    "keywords": [
      "minimal number",
      "lower bound",
      "non-zero determinant"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}