Bounding the number of \(k\)-faces in arrangements of hyperplanes

DOI10.1016/0166-218X(91)90067-7zbMath0742.52012MaRDI QIDQ1175787

Akihisa Tamura, Komei Fukuda, Takeshi Tokuyama, Shigemasa Saito

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

arrangement of hyperplanes\(f\)-vector\(h\)-vectororiented matroidssimple arrangement\(k\)-facespherical arrangements

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial geometries and geometric closure systems (51D20)

Related Items

Reverse search for enumeration, Manifold arrangements, Combinatorial face enumeration in arrangements and oriented matroids, A theorem on the average number of subfaces in arrangements and oriented matroids, Notes on acyclic orientations and the shelling lemma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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