A balanced non-partitionable Cohen-Macaulay complex
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:NH5R5T6Lrecord.jsonopen to challenge →
classification
math.CO
math.AC
keywords
balancedcohen-macaulaycomplexconjectureduvalanswerscoloringconstruct
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.