most citedReconstructing Nearly Simple Polytopes from their Graph

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

collaborators

3 papers

math.MG2019

Combinatorial Inscribability Obstructions for Higher-Dimensional Polytopes

Joseph Doolittle, Jean-Philippe Labbé, Carsten E. M. C. Lange +3

For -dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hype…

math.CO2019

Minimal Cohen-Macaulay Simplicial Complexes

Hailong Dao, Joseph Doolittle, Justin Lyle

We define and study the notion of a minimal Cohen-Macaulay simplicial complex. We prove that any Cohen-Macaulay complex is shelled over a minimal one in our sense, and we give suff…

math.CO2017★ 2 cited

Reconstructing Nearly Simple Polytopes from their Graph

Joseph Doolittle

We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that…