Supersolvable restrictions of reflection arrangements

DOI10.1016/j.jcta.2014.07.002zbMath1301.05054arXiv1311.0620OpenAlexW2964335561MaRDI QIDQ406580

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)

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

zbMATH Keywords

complex reflection groupssupersolvable arrangementsfree arrangementsreflection arrangements

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• GAP
• SageMath
• CHEVIE

Cites Work

• Unnamed Item
• Unnamed Item
• On inductively free restrictions of reflection arrangements.
• Free arrangements of hyperplanes and supersolvable lattices
• Arrangements defined by unitary reflection groups
• CHEVIE -- A system for computing and processing generic character tables
• Supersolvable lattices
• Supersolvable reflection arrangements
• Differential Equations Invariant Under Finite Reflection Groups
• Finite Unitary Reflection Groups