A lower bound on the number of cells in arrangements of hyperplanes

DOI10.1016/0097-3165(76)90027-3zbMath0336.50009OpenAlexW2036993874MaRDI QIDQ1230241

Robert W. Shannon

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(76)90027-3

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Projective analytic geometry (51N15)

Related Items

A lower bound on the number of sharp shadow-boundaries of convex polytopes ⋮ On a matching arrangement of a graph and \(LP\)-orientations of a matching polyhedron ⋮ Oriented matroids with few mutations ⋮ The Holt-Klee condition for oriented matroids ⋮ The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements ⋮ On the number of domains of maximal dimension in partitions of projective spaces by hyperplane arrangements

Cites Work

• Unnamed Item
• Unnamed Item
• Extensions of Sylvester's Theorem
• A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.
• The Lines and Planes Connecting the Points of a Finite Set