{
  "id": "2306.11310",
  "version": "v1",
  "published": "2023-06-20T06:10:56.000Z",
  "updated": "2023-06-20T06:10:56.000Z",
  "title": "Free paths of arrangements of hyperplanes",
  "authors": [
    "Takuro Abe",
    "Toru Yamaguchi"
  ],
  "comment": "12 pages",
  "categories": [
    "math.CO",
    "math.AC"
  ],
  "abstract": "We study the free path problem, i.e., if we are given two free arrangements of hyperplanes, then we can connect them by free arrangements or not. We prove that if an arrangement $\\mathcal{A}$ and $\\mathcal{A} \\setminus \\{H,L\\}$ are free, then at least one of two among them is free. When $\\mathcal{A}$ is in the three dimensional arrangement, we show a stronger statement.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-06-20T06:10:56.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "32S22"
    ],
    "keywords": [
      "hyperplanes",
      "free arrangements",
      "free path problem",
      "dimensional arrangement"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}