Combinatorial bases in systems of simplices and chambers (Q1924356)

Let \(E\) be a finite point set in affine \(n\)-space and consider two sets of objects generated by \(E\): the system \(\Sigma\) of \(n\)-simplices spanned by points from \(E\), and the system \(\Gamma\) of chambers. (If \(\widetilde{\Sigma}\) denotes the union of the boundaries of all simplices from \(\Sigma\), \(P=\text{conv }E\), \(\widetilde{P}= P\setminus \widetilde{\Sigma}\), and \(\widetilde{\gamma}\) is a connected component of \(P\) with \(\gamma\) as its closure, then \(\gamma\) is a chamber and \(\widetilde{\gamma}\) an open chamber.) Clearly, all the simplices from \(\Sigma\) and all the chambers from \(\Sigma\) cover the convex \(n\)-polytope \(P\). The author considers the incidence matrix \(A=|a_{\sigma,\gamma}|\), \(\sigma\in\Sigma\), \(\gamma\in\Gamma\), with \(a_{\sigma,\gamma}=1\) if \(\gamma\subset \sigma\), and \(a_{\sigma,\gamma}=0\) if \(\gamma\not\subset \sigma\), which defines the notion of linear independence and the rank of the system \(\Sigma\) and of the system \(\Gamma\). The notion of a combinatorial basis of chambers is introduced, and its construction for the two-dimensional situation is given. With every such basis, a basis of simplices is associated. From the construction algorithm a formula for the rank of the relation \((A;\Sigma,\Gamma)\) is obtained, and also the basis of simplices is constructed. Finally, an extension to \(n\)-space is announced.