Recursively free reflection arrangements
Group Theory
2020-03-05 v2 Combinatorics
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.
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