English

Recursively free reflection arrangements

Group Theory 2020-03-05 v2 Combinatorics

Abstract

Let A=A(W)\mathcal{A} = \mathcal{A}(W) be the reflection arrangement of the finite complex reflection group WW. By Terao's famous theorem, the arrangement A\mathcal{A} is free. In this paper we classify all reflection arrangements which belong to the smaller class of recursively free arrangements. Moreover for the case that WW admits an irreducible factor isomorphic to G31G_{31} we obtain a new (computer free) proof for the non-inductive freeness of A(W)\mathcal{A}(W). Since our classification implies the non-recursive freeness of the reflection arrangement A(G31)\mathcal{A}(G_{31}), we can prove a conjecture by Abe about the new class of divisionally free arrangements which he recently introduced.

Keywords

Cite

@article{arxiv.1512.00867,
  title  = {Recursively free reflection arrangements},
  author = {Paul Mücksch},
  journal= {arXiv preprint arXiv:1512.00867},
  year   = {2020}
}

Comments

26 pages, 3 figures. Corrected typos, added reference in section 5. Results unchanged

R2 v1 2026-06-22T12:00:02.188Z