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

DOI10.1016/0097-3165(76)90027-3MaRDI QIDQ1230241zbMATH OpenOpenAlexFDO

Authors 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) Projective analytic geometry (51N15) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites work

• A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.
• Extensions of Sylvester's Theorem
• scientific article; zbMATH DE number 3113224 (Why is no real title available?)
• scientific article; zbMATH DE number 3292551 (Why is no real title available?)
• The Lines and Planes Connecting the Points of a Finite Set

Cited in

(6)

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

This page was built for publication: A lower bound on the number of cells in arrangements of hyperplanes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230241)