{
  "id": "1908.10157",
  "version": "v1",
  "published": "2019-08-27T12:21:42.000Z",
  "updated": "2019-08-27T12:21:42.000Z",
  "title": "On complexity of representations of quivers",
  "authors": [
    "Victor G. Kac"
  ],
  "comment": "7 pages",
  "categories": [
    "math.RT"
  ],
  "abstract": "It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-08-27T12:21:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "representation",
      "complexity"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}