Guillermo Pineda-Villavicencio

activity

20102026

most citedLower bound theorems for general polytopes

14 citations · 46 across the 26 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015

Almost simplicial polytopes I. The lower and upper bound theorems

Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon +1

We study $n$ -vertex $d$ -dimensional polytopes with at most one nonsimplex facet with, say, $d + s$ 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 $d$ -dimensional polytope with $v$ vertices, $d + 1 \leq v \leq 2 d$ , we calculate precisely the minimum possible number of $m$ -dimensional faces, when $m = 1$ or $m \geq 0.62 d$ . This conf…