On reconstructing arrangements from their sets of simplices (Q1841902)

Let \(G_{\mathcal H}(S, H)\) be the bipartite graph with partition sets \(S\) and \(H\), the sets of simplices and hyperplanes of an arrangement \({\mathcal H}\), where the simplex \(s\in S\) is adjacent to the hyperplane \(h\in H\) if one facet of \(s\) lies on \(h\). The paper gives a complete characterization of \(G_{\mathcal H}(S, H)\) when \({\mathcal H}\) is a \(\Gamma\)-arrangement, which is constructed from a \(\Gamma\)-oriented matroid. It also gives a method to determine all the simplices of a \(\Gamma\)-arrangement by using the information of its corresponding \(\Gamma\)-oriented matroid. It is shown that any \(\Gamma\)-arrangement can be reconstructed by using only its set of simplices. Moreover, given an \(r\)-regular bipartite graph \(G(S, H)\) with \(|S|=|H|= n\), \(G(S, H)\) is the simplex graph of a \(\Gamma\)-arrangement if, and only if, \(G(S, H)\) admits a special labeling called \(\Gamma\)-labeling.