Recursively free reflection arrangements

preprint2015arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.