14 citations · 19 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
A lower bound theorem for -polytopes with vertices
Guillermo Pineda-Villavicencio, David Yost
The problem of calculating exact lower bounds for the number of -faces of -polytopes with vertices, for each value of , and characterising the minimisers, has recently…
math.CO2021
Lower bound results for conditionally decomposable polytopes
Jie Wang, David Yost
It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Suc…