Paper detail

Recursively free reflection arrangements

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

preprint2015arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

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

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.