Combinatorial simpliciality of arrangements of hyperplanes

DOI10.1007/S13366-014-0190-XMaRDI QIDQ747565zbMATHOpenAlexFDO

Authors 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

projective planesimplicialarrangement of hyperplanes

Mathematics Subject Classification ID

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

Abstract: We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present some series of arrangements related to the known arrangements in characteristic zero. We further enumerate simplicial arrangements with given symmetry groups. Finally, we determine all finite complex reflection groups affording combinatorially simplicial arrangements. It turns out that combinatorial simpliciality coincides with inductive freeness for finite complex reflection groups except for the Shephard-Todd group $G_{31}$.

Recommendations

• Simplicial arrangements with up to 27 lines
• scientific article; zbMATH DE number 3890243
• Supersolvable simplicial arrangements
• A simplicial 3-arrangement of 21 planes
• A simplicial 4-arrangement of 33 hyperplanes

Cites work

• scientific article; zbMATH DE number 4004443 (Why is no real title available?)
• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• scientific article; zbMATH DE number 3454467 (Why is no real title available?)
• scientific article; zbMATH DE number 3040001 (Why is no real title available?)
• A catalogue of simplicial arrangements in the real projective plane
• An introduction to hyperplane arrangements
• Characteristic polynomials of subspace arrangements and finite fields
• Coxeter and crystallographic arrangements are inductively free
• Crystallographic arrangements: Weyl groupoids and simplicial arrangements.
• Finite Weyl groupoids
• Free but not recursively free arrangements
• Les immeubles des groupes de tresses généralises
• Minimal fields of definition for simplicial arrangements in the real projective plane
• On inductively free reflection arrangements.
• Simplicial arrangements revisited
• Simplicial arrangements with up to 27 lines
• The Representations of GL(3,q), GL(4,q), PGL(3,q), and PGL(4,q)

Cited in

(19)

• Reducibility of hyperplane arrangements
• The Minimal Model of the Complement of an Arrangement of Hyperplanes
• Fundamental polytopes of metric trees via parallel connections of matroids
• Simplicial arrangements on convex cones
• The complexity of many cells in arrangements of planes and related problems
• Supersolvable simplicial arrangements
• Factored arrangements of hyperplanes
• Chambers of arrangements of hyperplanes and Arrow's impossibility theorem
• On the enumeration of a certain type of hyperplane arrangements
• On the combinatorial structure of \(0/1\)-matrices representing nonobtuse simplices
• On reconstructing arrangements from their sets of simplices
• A greedy algorithm to compute arrangements of lines in the projective plane
• Multiple addition, deletion and restriction theorems for hyperplane arrangements
• Simplicial cross-polytopic d-arrangements
• scientific article; zbMATH DE number 1223435 (Why is no real title available?)
• Free but not recursively free arrangements
• Hyperplane arrangements separating arbitrary vertex classes in \(n\)-cubes
• On the geometry of flag Hilbert-Poincaré series for matroids
• On the geometry of flag Hilbert-Poincaré series for matroids

This page was built for publication: Combinatorial simpliciality of arrangements of hyperplanes

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