Supersolvable restrictions of reflection arrangements

DOI10.1016/J.JCTA.2014.07.002zbMATH Open1301.05054arXiv1311.0620OpenAlexW2964335561MaRDI QIDQ406580FDOQ406580

Nils Amend, Torsten Hoge, Gerhard Röhrle

Publication date: 8 September 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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. For X in L(A), it is known that the restriction A^X is supersolvable provided A is. Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A(W) = (A(W), V) be its associated hyperplane arrangement. In earlier work by the last two authors, we classified all supersolvable reflection arrangements. Extending this work, the aim of this note is to determine all supersolvable restrictions of reflection arrangements. It turns out that apart from the obvious restrictions of supersolvable reflection arrangements there are only a few additional instances. Moreover, in our previous work, we classified all inductively free restrictions A(W)^X of reflection arrangements A(W). Since every supersolvable arrangement is inductively free, the supersolvable restrictions A(W)^X of reflection arrangements A(W) form a natural subclass of the class of inductively free restrictions A(W)^X. Finally, we characterize the irreducible supersolvable restrictions of reflection arrangements by the presence of modular elements of dimension 1 in their intersection lattice. This in turn shows that reflection arrangements as well as their restrictions are of fiber type if and only if they are strictly linearly fibered.

Full work available at URL: https://arxiv.org/abs/1311.0620

Recommendations

• Supersolvable reflection arrangements.
• On inductively free reflection arrangements.
• Free arrangements of hyperplanes and supersolvable lattices
• Supersolvable orders and inductively free arrangements
• Reflection arrangements are hereditarily free

zbMATH Keywords

complex reflection groupsfree arrangementsreflection arrangementssupersolvable arrangements

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Configurations and arrangements of linear subspaces (14N20)

Cites Work

• CHEVIE -- A system for computing and processing generic character tables
• Title not available (Why is that?)
• Free arrangements of hyperplanes and supersolvable lattices
• Supersolvable lattices
• Supersolvable reflection arrangements
• Title not available (Why is that?)
• On inductively free restrictions of reflection arrangements.
• Finite Unitary Reflection Groups
• Arrangements defined by unitary reflection groups
• Differential Equations Invariant Under Finite Reflection Groups

Cited In (6)

• Supersolvable simplicial arrangements
• Localizations of Inductively Factored Arrangements
• Counting chambers in restricted Coxeter arrangements
• Nice restrictions of reflection arrangements
• Reflection arrangements are hereditarily free
• Supersolvable orders and inductively free arrangements

Uses Software

• GAP
• SageMath
• CHEVIE

This page was built for publication: Supersolvable restrictions of reflection arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406580)