On inductively free reflection arrangements.

From MaRDI portal
Publication:2018384



Abstract: Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. There is the stronger notion of an inductively free arrangement. In 1992, Orlik and Terao conjectured that each reflection arrangement is inductively free. It has been known for quite some time that the braid arrangement as well as the Coxeter arrangements of type B and type D are inductively free. Barakat and Cuntz completed this list only recently by showing that every Coxeter arrangement is inductively free. Nevertheless, Orlik and Terao's conjecture is false in general. In a recent paper, we already gave two counterexamples to this conjecture among the exceptional complex reflection groups. In this paper we classify all inductively free reflection arrangements. In addition, we show that the notions of inductive freeness and that of hereditary inductive freeness coincide for reflection arrangements. As a consequence of our classification, we get an easy, purely combinatorial characterization of inductively free reflection arrangements A in terms of exponents of the restrictions to any hyperplane of A.


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.











This page was built for publication: On inductively free reflection arrangements.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018384)