Counting plane arrangements via oriented matroids
Stefan Forcey
TL;DR
The paper surveys how oriented matroids encode the combinatorial structure of plane and hyperplane arrangements, focusing on the relationship between sign-vector descriptions and geometric faces. It explains the foundational axioms, affine enhancements via a marked element, and the suspension/cone construction that connects affine and essential arrangements, then discusses counting problems and known counterexamples to representability and stretchability. Leveraging results from Finschi and Goodman–Pollack, it highlights how many affine arrangements arise from oriented matroids and where realizability fails (e.g., the Pappus arrangement for $9$ lines and nonstretchable pseudolines/pseudoplanes). The authors illustrate the $n=4$ and $n=5$ cases in $\mathbb{R}^3$, enumerating $27$ rank-3 arrangements for $n=5$ and showing how invariants distinguish face-combinatorial types, thereby clarifying the landscape of plane arrangements and identifying open questions in realizability and enumeration.
Abstract
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets: the planes can intersect or not. Here we review how oriented matroids can be used to try to capture the combinatorial aspect, giving a way to encode with finite sets all the ways that $n$ planes can interact. We mention how the one-to-one correspondence breaks down in 2 dimensions for 9 lines, and in 3D for 8 planes. We include illustrations of all the types of plane arrangements using $n=4$ and 5.
