{
  "id": "1802.04870",
  "version": "v1",
  "published": "2018-02-13T21:48:14.000Z",
  "updated": "2018-02-13T21:48:14.000Z",
  "title": "Algorithmic problems in right-angled Artin groups: complexity and applications",
  "authors": [
    "Ramón Flores",
    "Delaram Kahrobaei",
    "Thomas Koberda"
  ],
  "comment": "16 pages",
  "categories": [
    "math.GR",
    "math.AT",
    "math.GT"
  ],
  "abstract": "In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with a view towards applications to cryptography.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-02-13T21:48:14.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20F36"
    ],
    "keywords": [
      "right-angled artin groups",
      "applications",
      "novel algorithmic problems",
      "graph theoretic problems",
      "computational complexity"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}