scientific article; zbMATH DE number 7203478
From MaRDI portal
Publication:5111020
zbMATH Open1465.52023MaRDI QIDQ5111020FDOQ5111020
Authors: Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon, David Yost
Publication date: 26 May 2020
Full work available at URL: https://dmtcs.episciences.org/6369
Title of this publication is not available (Why is that?)
Recommendations
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
- McMullen's conditions and some lower bounds for general convex polytopes
- Shellings and the lower bound theorem
- scientific article; zbMATH DE number 697092
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
- A comparison theorem for \(f\)-vectors of simplicial polytopes
- On the Monotone Upper Bound Problem
- Triangulations of simplicial polytopes
- Disproof of a conjecture on assignment functions
- A lower bound theorem for centrally symmetric simplicial polytopes
Cites Work
- The minimum number of vertices of a simple polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The maximum numbers of faces of a convex polytope
- The number of faces of a simplicial convex polytope
- A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
- A proof of the lower bound conjecture for convex polytopes
- Title not available (Why is that?)
- Remarks on the combinatorial intersection cohomology of fans
- The maximum number of faces of the Minkowski sum of two convex polytopes
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
- The numbers of faces of simplicial polytopes
- Rigidity and the lower bound theorem. I
- The number of faces of polytope pairs and unbounded polyhedra
- A characterization of simplicial polytopes with \(g_{2}=1\)
- Intersection homology of toric varieties and a conjecture of Kalai
Cited In (14)
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
- Remarks on the upper bound theorem.
- Title not available (Why is that?)
- The almost simple cubical polytopes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lower and upper bound problems for cubical polytopes
- The maximum number of complementary facets of a simplicial polytope
- Characterizing face and flag vector pairs for polytopes
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
- Title not available (Why is that?)
- Remarks on missing faces and generalized lower bounds on face numbers
- An upper bound on the shortness exponent of inscribable polytopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111020)