Recursively free reflection arrangements

From MaRDI portal




Abstract: Let mathcalA=mathcalA(W) be the reflection arrangement of the finite complex reflection group W. By Terao's famous theorem, the arrangement mathcalA 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 W admits an irreducible factor isomorphic to G31 we obtain a new (computer free) proof for the non-inductive freeness of mathcalA(W). Since our classification implies the non-recursive freeness of the reflection arrangement mathcalA(G31), we can prove a conjecture by Abe about the new class of divisionally free arrangements which he recently introduced.





Describes a project that uses

Uses Software





This page was built for publication: Recursively free reflection arrangements

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