2000 character limit reached
Simplicial complexes which are minimal Cohen-Macaulay
Published 30 Mar 2021 in math.AC | (2103.16078v4)
Abstract: Let $\D$ be a $(d-1)$-dimensional pure $f$-simplicial complex over vertex set $[n]$. In this paper, it is proved that $n=2d$ holds true if $\D$ is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies that shellable condition on a pure simplicial complex $\D$ is identical with CM properties of a full series of subcomplexes of $\D$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.