On low-dimensional faces that high-dimensional polytopes must have

DOI10.1007/BF02122781zbMath0721.52008OpenAlexW2076248730MaRDI QIDQ2640884

Gil Kalai

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02122781

zbMATH Keywords

tilingsfaces of polytopesn-dimensional polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)

Related Items (9)

Acute Geodesic Triangulations of Manifolds ⋮ A note on the simplex-cosimplex problem ⋮ Some applications of algebra to combinatorics ⋮ A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector ⋮ Coxeter groups, hyperbolic cubes and acute triangulations ⋮ Erratum to: There is no face-to-face partition of \(R ^{5}\) into acute simplices ⋮ Facets with fewest vertices ⋮ The signature of a toric variety. ⋮ Triangle-free polytopes with few facets

Cites Work

• Unnamed Item
• Unnamed Item
• Rigidity and the lower bound theorem. I
• A new basis of polytopes
• The existence on non-tiles and non-facets in three dimensions
• Über die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-Seiten
• Balanced subdivision and enumeration in balanced spheres
• Nonfacets for shellable spheres
• On certain polytopes associated with graphs
• The extended f-vectors of 4-polytopes
• The associahedron and triangulations of the \(n\)-gon
• Facets and nonfacets of convex polytopes
• A simple 4-dimensional nonfacet
• A proof of the lower bound conjecture for convex polytopes
• Convex polytopes without triangular faces
• Nontiles and nonfacets for the Euclidean space, spherical complexes and convex polytopes.
• Balanced Cohen-Macaulay Complexes
• A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.

This page was built for publication: On low-dimensional faces that high-dimensional polytopes must have