Bounding the number of \(k\)-faces in arrangements of hyperplanes
DOI10.1016/0166-218X(91)90067-7zbMath0742.52012MaRDI QIDQ1175787
Akihisa Tamura, Takeshi Tokuyama, Komei Fukuda, Shigemasa Saito
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
arrangement of hyperplanes; \(f\)-vector; \(h\)-vector; oriented matroids; simple arrangement; \(k\)-face; spherical arrangements
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
52C35: Arrangements of points, flats, hyperplanes (aspects of discrete geometry)
51D20: Combinatorial geometries and geometric closure systems
Related Items
Cites Work
- A theorem on the average number of subfaces in arrangements and oriented matroids
- Combinatorial complexity bounds for arrangements of curves and spheres
- The power of geometric duality
- Combinatorics and topology of complements of hyperplanes
- Convexity in oriented matroids
- Combinatorial face enumeration in arrangements and oriented matroids
- Orientability of matroids
- Tessellations generated by hyperplanes
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Partition of Space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item