Recursively free reflection arrangements
arXiv:1512.00867 · doi:10.1016/j.jalgebra.2016.10.041
Abstract
Let be the reflection arrangement of the finite complex reflection group . By Terao's famous theorem, the arrangement 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 admits an irreducible factor isomorphic to we obtain a new (computer free) proof for the non-inductive freeness of . Since our classification implies the non-recursive freeness of the reflection arrangement , we can prove a conjecture by Abe about the new class of divisionally free arrangements which he recently introduced.
arXiv comment26 pages, 3 figures. Corrected typos, added reference in section 5. Results unchanged
References in corpus (5)
- Coxeter and crystallographic arrangements are inductively free
- Free filtrations of affine Weyl arrangements and the ideal-Shi arrangements
- Non-recursive freeness and non-rigidity of plane arrangements
- Divisionally free Restrictions of Reflection Arrangements
- Inductive and Recursive Freeness of Localizations of Multiarrangements