Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
DOI10.4153/S0008414X18000123zbMath1444.52005arXiv1510.08258OpenAlexW2963223045MaRDI QIDQ5222174
Guillermo Pineda-Villavicencio, David Yost, Julien Ugon, Eran Nevo
Publication date: 1 April 2020
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.08258
\(f\)-vector\(h\)-vectorupper bound theoremgraph rigiditylower bound theoremalmost simplicial polytope
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Shellability for polytopes and polyhedra (52B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum number of faces of the Minkowski sum of two convex polytopes
- On the generalized lower bound conjecture for polytopes and spheres
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- Rigidity and the lower bound theorem. I
- A characterization of simplicial polytopes with \(g_{2}=1\)
- \(f\)-vectors of triangulated balls
- Hard Lefschetz theorem for nonrational polytopes
- Remarks on the combinatorial intersection cohomology of fans
- Intersection homology of toric varieties and a conjecture of Kalai
- The number of faces of a simplicial convex polytope
- The rigidity of graphs. II
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- The number of faces of polytope pairs and unbounded polyhedra
- The numbers of faces of simplicial polytopes
- The minimum number of vertices of a simple polytope
- A proof of the lower bound conjecture for convex polytopes
- Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
- The Rigidity of Graphs
- Lectures on Polytopes
- Convex Polytopes
- The maximum numbers of faces of a convex polytope
- A generalized lower‐bound conjecture for simplicial polytopes
- Shellable Decompositions of Cells and Spheres.
This page was built for publication: Almost Simplicial Polytopes: The Lower and Upper Bound Theorems