Supersolvable reflection arrangements

DOI10.1090/S0002-9939-2014-12144-7zbMath1331.20050arXiv1209.1919OpenAlexW2594857767MaRDI QIDQ3190383

Torsten Hoge, Gerhard Röhrle

Publication date: 17 September 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

modular elementscomplex reflection groupssupersolvable arrangementsfree arrangementsreflection arrangements

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Configurations and arrangements of linear subspaces (14N20)

Related Items (14)

Addition-deletion theorems for factorizations of Orlik-Solomon algebras and nice arrangements ⋮ Nice reflection arrangements. ⋮ Logarithmic vector fields and freeness of divisors and arrangements: new perspectives and applications. Abstracts from the workshop held January 24--30, 2021 (online meeting) ⋮ Nice restrictions of reflection arrangements ⋮ Rationally smooth Schubert varieties and inversion hyperplane arrangements ⋮ Supersolvable restrictions of reflection arrangements ⋮ Supersolvable simplicial arrangements ⋮ Vertex-weighted digraphs and freeness of arrangements between Shi and Ish ⋮ On the Milnor monodromy of the exceptional reflection arrangement of type \(G_{31}\) ⋮ Modular equalities for complex reflection arrangements ⋮ Supersolvable orders and inductively free arrangements ⋮ A broad class of shellable lattices ⋮ A vanishing result for the first twisted cohomology of affine varieties and applications to line arrangements ⋮ Arrangements of ideal type

Uses Software

• GAP
• CHEVIE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Free arrangements of hyperplanes and supersolvable lattices
• The lower central series of a fiber-type arrangement
• Modular elements of lattices and topological fibration
• CHEVIE -- A system for computing and processing generic character tables
• On inductively free reflection arrangements.
• Finite complex reflection arrangements are \(K(\pi,1)\)
• Les immeubles des groupes de tresses généralises
• Supersolvable lattices
• Invariants of Finite Reflection Groups
• Configuration Spaces.
• Finite Unitary Reflection Groups

This page was built for publication: Supersolvable reflection arrangements