Combinatorial simpliciality of arrangements of hyperplanes (Q747565): Difference between revisions

A central hyperplane arrangement in \(\mathbb R^n\) is said to be simplicial if each chamber is an open simplicial cone. Such arrangements were introduced by \textit{E. Melchior} [Deutsche Math. 5, 461-475 (1941; Zbl 0025.09105)] and studied extensively by others. It has also been shown that this notion of simpliciality in \(R^n\) can also be defined via a combinatiorial property of its intersection lattice. Using this combinatorial notion of simpliciality, an arrangement in \(K^3\) is defined to be simplicial for any field \(K\). In the paper under review, the authors prove a necessary and sufficient combinatorial condition for which an essential central arrangement in \(F_q^3\) is simplicial. Using their condition, the authors obtain the sharp bound of \(3q\) for the number of hyperplanes in a simplicial arrangement of \(F_q^3\). The authors study extensively the combinatorially simplicial arrangements in \(F_q^3\) which have a given symmetry group.