activity
20172024
most citedReconstructing Nearly Simple Polytopes from their Graph

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

collaborators
Showing 2019 · math.COShow all

2 papers · 2 filters

math.CO2019

Partition and Cohen-Macaulay Extenders

Joseph Doolittle, Bennet Goeckner, Alexander Lazar

If a pure simplicial complex is partitionable, then its -vector has a combinatorial interpretation in terms of any partitioning of the complex. Given a non-partitionable complex…

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…