Papers
Topics
Authors
Recent
2000 character limit reached

On supersolvable reflection arrangements (1209.1919v3)

Published 10 Sep 2012 in math.GR and math.CO

Abstract: Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable, a notion due to Stanley. Jambu and Terao showed that every supersolvable arrangement is inductively free, a notion due to Terao. So this is a natural subclass of this particular class of free arrangements. Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = (A(W), V) be the associated hyperplane arrangement of W. In a paper, we determined all inductively free reflection arrangements. The aim of this note is to classify all supersolvable reflection arrangements. Moreover, we characterize the irreducible arrangements in this class by the presence of modular elements of rank 2 in their intersection lattice.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.