The upper bound conjecture for arrangements of halfspaces
Let \(A\) be an arrangement of \(n\) open halfspaces in \(\mathbb{R}^{d}\) and denote by \(g_{s,k}(A)\) the number of faces of dimension \(s\) contained in at most \(k\) halfspaces of \(A\). The upper bound conjecture for arrangements of halfspaces says that \(g_{s,k}(A)\) is bounded above by the number of covectors of rank \(s+1\) with at most \(k\) plus signs in the alternating oriented matroid of rank \(d+1\) on \(n\) elements, for \(k\leq n-(d-s)\). This is a generalization of the well-known upper bound theorem for convex polytopes, which corresponds to the case \(k=0\). Here the conjecture is proved for \(d\leq 4\) and \(s\leq 3\) by a substantial extension of ideas of \textit{J. Linhart}, who had given a proof for \(d\leq 4\) and \(s=0\) [Beitr. Algebra Geom. 35, 29-35 (1994; Zbl 0806.52011)].
- A bound on local minima of arrangements that implies the upper bound theorem
- Arrangements of oriented hyperplanes
- The upper bound conjecture for arrangements of half-spaces
- Arrangements of hemispheres and halfspaces
- The finite upper half space and related hypergraphs
- Roudneff's conjecture for Lawrence oriented matroids
- Hyperplane Arrangements with Large Average Diameter
- scientific article; zbMATH DE number 1017097 (Why is no real title available?)
- Non-zero boundaries of Leibniz half-spaces
- A theorem on the average number of subfaces in arrangements and oriented matroids
This page was built for publication: The upper bound conjecture for arrangements of halfspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948419)