Generalizing the notion of arrangement of lines in the plane one defines a projective d-arrangement A as a finite set of hyperplanes in d- dimensional real projective space \({\mathbb{P}}^ d\) having empty intersection; such an arrangement is called simplicial if all the open connected components of \({\mathbb{P}}^ d\setminus (\cup A)\) are simplicies. Higher dimensional simplicial arrangements can be built up from two lower dimensional ones by a suitable join construction: a simplicial arrangement that cannot be obtained in this way is called sporadic. Extending Grünbaum's facet hyperplane method the authors consider a regular tetrahedron in 3-dimensional Euclidean space and produce a 3- arrangement consisting of 21 planes in \({\mathbb{P}}^ 3\); by giving all the relevant informations about the incidence properties of this arrangement, they are able to prove that it is simplicial and sporadic and furthermore that it is not isomorphic to any one of the 15 sporadic simplicial 3- arrangements that were known so far. In an analogous way, for \(d\geq 4\) one can define a d-arrangement starting from a regular d-dimensional simplex: the authors conclude mentioning the conjecture that for \(d=4\) (and eventually for each d) such arrangement be simplicial.
- A simplicial 3-arrangement of 22 planes
- Simplicial arrangements with up to 27 lines
- A simplicial 4-arrangement of 33 hyperplanes
- Simplicial arrangements associated with the 24-cell
- scientific article; zbMATH DE number 3890243
- On the nearly free simplicial line arrangements with up to 27 lines
- Simplicial arrangements revisited
- Coxeter arrangements in three dimensions
- scientific article; zbMATH DE number 6470146
- Polytopes in arrangements
- A simplicial 3-arrangement of 22 planes
- On d-arrangements associated with a simplex
- A simplicial 4-arrangement of 33 hyperplanes
- Cells with many facets in arrangements of hyperplanes
- Grünbaum 4-arrangements on the 120-cell and the 600-cell
- Simplicial arrangements associated with the 24-cell
- Simplicial arrangements on convex cones
- Which Grünbaum arrangements are simplicial?
- Supersolvable simplicial arrangements
- A greedy algorithm to compute arrangements of lines in the projective plane
- Coxeter arrangements in three dimensions
- Simplicial arrangements revisited
- Combinatorial simpliciality of arrangements of hyperplanes
This page was built for publication: A simplicial 3-arrangement of 21 planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082607)
