{
  "id": "math/0701445",
  "version": "v1",
  "published": "2007-01-16T19:03:47.000Z",
  "updated": "2007-01-16T19:03:47.000Z",
  "title": "Topological complexity of generic hyperplane arrangements",
  "authors": [
    "Sergey Yuzvinsky"
  ],
  "categories": [
    "math.GT",
    "math.CO"
  ],
  "abstract": "We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\\{n+1,2r\\}$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2007-01-16T19:03:47.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "52C35",
      "55R80"
    ],
    "keywords": [
      "generic hyperplane arrangements",
      "topological complexity",
      "generic complex essential hyperplane arrangement",
      "dimensional linear space",
      "motion planning algorithm"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007math......1445Y"
    }
  }
}