On inductively free reflection arrangements. (Q2018384)

Let \(\mathcal A\) be a hyperplane arrangement. We say \(\mathcal A\) is free to mean that the module of derivations is free over the polynomial ring. A stronger condition is to say that \(\mathcal A\) is inductively free. Supersolvable arrangements, the braid arrangement, and Coxeter arrangements are famous classes of inductively free arrangements. It was conjectured in [\textit{P. Orlik} and \textit{H. Terao}, Arrangements of hyperplanes. Grundlehren der Mathematischen Wissenschaften 300. Berlin: Springer-Verlag (1992; Zbl 0757.55001)] that reflection arrangements are inductively free; however, this is a false conjecture. In the paper under review, the authors are motivated by this conjecture and classify all inductively free reflection arrangements. Theorem. For \(W\) a finite complex reflection group, the reflection arrangement \(\mathcal A(W)\) of \(W\) is inductively free if and only if \(W\) does not admit an irreducible factor isomorphic to a monomial group \(G(r,r,\ell)\) for \(\ell\geq 3\), \(G_{24}\), \(G_{27}\), \(G_{29}\), \(G_{31}\), \(G_{33}\), or \(G_{34}\). Moreover, the authors prove that for a reflection arrangement, inductively free is equivalent to hereditary inductively free. Using this fact, the authors obtain a combinatorial characterization of inductively free reflection arrangement in terms of exponents.