Combinatorial simpliciality of arrangements of hyperplanes

DOI10.1007/s13366-014-0190-xzbMath1331.52030arXiv1302.2052OpenAlexW1982284001MaRDI QIDQ747565

Michael Cuntz, David Geis

Publication date: 16 October 2015

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

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

zbMATH Keywords

arrangement of hyperplanesprojective planesimplicial

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial structures in finite projective spaces (51E20)

Related Items

Fundamental polytopes of metric trees via parallel connections of matroids ⋮ A greedy algorithm to compute arrangements of lines in the projective plane ⋮ On the geometry of flag Hilbert-Poincaré series for matroids ⋮ On the geometry of flag Hilbert-Poincaré series for matroids ⋮ Supersolvable simplicial arrangements ⋮ Free but not recursively free arrangements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal fields of definition for simplicial arrangements in the real projective plane
• Coxeter and crystallographic arrangements are inductively free
• Simplicial arrangements with up to 27 lines
• On inductively free reflection arrangements.
• Finite Weyl groupoids
• Les immeubles des groupes de tresses généralises
• Characteristic polynomials of subspace arrangements and finite fields
• A catalogue of simplicial arrangements in the real projective plane
• Crystallographic arrangements: Weyl groupoids and simplicial arrangements
• Simplicial arrangements revisited
• Free but not recursively free arrangements
• The Representations of GL(3,q), GL(4,q), PGL(3,q), and PGL(4,q)