A balanced non-partitionable Cohen-Macaulay complex
Martina Juhnke-Kubitzke, Lorenzo Venturello

TL;DR
This paper constructs balanced Cohen-Macaulay complexes that counter the longstanding conjecture by Stanley, demonstrating that not all such complexes are partitionable, thus providing new insights into their structural properties.
Contribution
The authors provide the first known balanced Cohen-Macaulay complexes that are non-partitionable, disproving Stanley's conjecture and answering a key open question.
Findings
Counterexamples are balanced Cohen-Macaulay complexes.
Stanley's conjecture on partitionability is false.
Balanced complexes can be non-partitionable.
Abstract
In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even \emph{balanced}, i.e., their underlying graph has a minimal coloring. This answers a question by Duval et al. in the negative.
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 · Advanced Combinatorial Mathematics · Algebraic structures and combinatorial models
