Simplicial cells in arrangements and mutations of oriented matroids
type: Item
instance of: scholarly article
title: Simplicial cells in arrangements and mutations of oriented matroids
zbMATH Open document ID: 0654.05019
DOI: 10.1007/BF00151346
author: Jean-Pierre Roudneff
author: Bernd Sturmfels
published in: Geometriae Dedicata
publication date: 1988-01-01T00:00:00Z
review text: The authors provide two proofs of a theorem of \textit{R. W. Shannon} [Geom. Dedicata 8, 179--187 (1979; Zbl 0423.51013)], one a modification of Shannon's proof, the other based on convexity arguments, that every arrangement of \(n\) hyperplanes in \(E^d\) has at least \(n\) simplicial cells, the bound being sharp for every \(n\) and \(d\). If \(M\) and \(M'\) denote two rank \(r\) uniform oriented matroids on \(E\), \(M\) and \(M'\) are mutants if they differ in exactly one simplex orientation. Then the base is called a mutation of \(M\) (and \(M'\)). This defines the mutation graph \(\mathcal G^{n,r}\) on the set of all rank \(r\) uniform oriented matroids on \(n\) elements: \(M\) and \(M'\) are joined by an edge in \(\mathcal G^{n,r}\) if and only if they are mutants. If \(\mathcal G^{n,r}_{\text{real}}\) is a subgraph of \(\mathcal G^{n,r}\) induced by the set of representable oriented matroids, then it is shown that \(\mathcal G^{n,r}_{\text{real}}\) is connected. Further the authors show that the concatenation operation of \textit{J. Lawrence} and \textit{L. Weinberg} [Linear Algebra Appl. 41, 183--200 (1981; Zbl 0517.05022)] can be used to generate a large class of arrangements of hyperplanes each with the minimal number of \(d\)-simplices. Shannon's ``cyclic arrangements'' are obtained as a special case. \textit{M. Las Vergnas} [J. Comb. Theory, Ser. B 29, 231--243 (1980; Zbl 0443.05026)] conjectured that every loopless oriented matroid has at least one acyclic reorientation with exactly \(r\) extreme points. In a theorem of Shannon's -- let \(M\) be a representable rank \(r\) oriented matroid on \(n\) elements without loops or parallel elements, then there exist at least \(n\) acyclic reorientations of \(M\), each with exactly \(r\) extreme points -- the above raises the question whether ``representable'' could be dropped from the statement. \textit{B. Grünbaum} [Arrangements and spreads. Providence, R. I.: AMS (1972; Zbl 0249.50011)] answered positively fo…
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 4066910
zbMATH Keywords: arrangement
zbMATH Keywords: oriented matroids
zbMATH Keywords: cyclic arrangements
reviewed by: Gerald L. Alexanderson
MaRDI profile type: Publication
Recommended article: Q3689778
Recommended article: Oriented matroids with few mutations
Recommended article: On the homotopy type of the Salvetti complexes determined by simplicial arrangements
Recommended article: A greedy algorithm to compute arrangements of lines in the projective plane
Recommended article: Q4304385
Recommended article: Oriented matroids from smooth manifolds
Recommended article: Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
Recommended article: Roudneff's conjecture for Lawrence oriented matroids
Recommended article: Q4400996
Recommended article: Hyperplane arrangements with a lattice of regions
description: scientific article; zbMATH DE number 4066910