Abstract

The theory of oriented matroids provides a broad setting in which to model, describe, and analyze combinatorial properties of geometric configurations. Mathematical objects of study that appear to be disjoint and independent, such as point and vector configurations, arrangements of hyperplanes, convex polytopes, directed graphs, and linear programs find a common generalization in the language of oriented matroids.