Simplicial complexes which are minimal Cohen-Macaulay
Yanyan Wang, Tongsuo Wu

TL;DR
This paper characterizes minimal Cohen-Macaulay simplicial complexes, proving that such complexes with certain properties have exactly twice as many vertices as their dimension plus one, and relates shellability to Cohen-Macaulay properties.
Contribution
It establishes a precise vertex count for minimal Cohen-Macaulay pure simplicial complexes and links shellability with Cohen-Macaulay properties of subcomplexes.
Findings
Minimal Cohen-Macaulay complexes have n=2d vertices.
Shellability of pure complexes is equivalent to Cohen-Macaulay properties of subcomplexes.
Provides a characterization connecting combinatorial and algebraic properties.
Abstract
Let be a -dimensional pure -simplicial complex over vertex set . In this paper, it is proved that holds true if is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies that shellable condition on a pure simplicial complex is identical with CM properties of a full series of subcomplexes of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Topological and Geometric Data Analysis · Advanced Combinatorial Mathematics
