14 citations · 19 across the 11 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
Almost simplicial polytopes I. The lower and upper bound theorems
Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon +1
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, called {\it almost simplicial polytopes}. We provide tight lower and uppe…
math.CO2015★ 14 cited
Lower bound theorems for general polytopes
Guillermo Pineda-Villavicencio, Julien Ugon, David Yost
For a -dimensional polytope with vertices, , we calculate precisely the minimum possible number of -dimensional faces, when or . This conf…