David Yost

activity

20172025

most citedPolytopes close to being simple

1 citations · 1 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2025

A refined lower bound theorem for $d$ -polytopes with at most $2 d$ vertices

Guillermo Pineda-Villavicencio, Jie Wang, David Yost

In 1967, Grünbaum conjectured that the function $ϕ_{k} (d + s, d) := (k + 1 d + 1) + (k + 1 d) - (k + 1 d + 1 - s), for 2 \leq s \leq d$ provides the minimum number of $k$ -…

math.CO2024

A lower bound theorem for $d$ -polytopes with $2 d + 2$ vertices

Guillermo Pineda-Villavicencio, Aholiab Tritama, Jie Wang +1

We establish a lower bound theorem for the number of $k$ -faces ( $1 \leq k \leq d - 2$ ) in a $d$ -dimensional polytope $P$ (abbreviated as a $d$ -polytope) with $2 d + 2$ vertices, extending t…

math.CO2024

Polytopes with low excess degree

Guillermo Pineda-Villavicencio, Jie Wang, David Yost

We study the existence and structure of $d$ -polytopes for which the number $f_{1}$ of edges is small compared to the number $f_{0}$ of vertices. Our results are more elegantly expresse…

math.CO2017★ 1 cited

Polytopes close to being simple

Guillermo Pineda-Villavicencio, Julien Ugon, David Yost

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$ -polytopes with at most $d - 2$ nonsimple vertices are reconstructib…

A refined lower bound theorem for d-polytopes with at most 2d vertices

A lower bound theorem for d-polytopes with 2d+2 vertices

Polytopes with low excess degree

Polytopes close to being simple

A refined lower bound theorem for $d$ -polytopes with at most $2 d$ vertices

A lower bound theorem for $d$ -polytopes with $2 d + 2$ vertices