A balanced non-partitionable cohen-macaulay complex

DC ElementWertSprache
dc.contributor.authorJuhnke-Kubitzke, M.
dc.contributor.authorVenturello, L.
dc.date.accessioned2021-12-23T16:33:29Z-
dc.date.available2021-12-23T16:33:29Z-
dc.date.issued2019
dc.identifier.issn25895486
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/17714-
dc.description.abstractIn a recent article, 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 balanced, i.e. their underlying graph has a minimal coloring. This answers a question by Duval et al. in the negative. © 2021 Academic Publishing House. All rights reserved.
dc.description.sponsorshipBoth authors were supported by the German Research Council DFG GRK-
dc.language.isoen
dc.publisherCentre Mersenne
dc.relation.ispartofAlgebraic Combinatorics
dc.subjectBalancedness
dc.subjectCohen-Macaulay
dc.subjectPartitionability
dc.subjectSimplicial complex
dc.titleA balanced non-partitionable cohen-macaulay complex
dc.typereview
dc.identifier.doi10.5802/alco.78
dc.identifier.scopus2-s2.0-85107573857
dc.identifier.urlhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85107573857&doi=10.5802%2falco.78&partnerID=40&md5=4c0619fe6aa5a960dc3f6e2dd255fca3
dc.description.volume2
dc.description.issue6
dc.description.startpage1149
dc.description.endpage1157
dcterms.isPartOf.abbreviationAlgebra. Comb.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidJuMa420-
Zur Kurzanzeige

Seitenaufrufe

1
Letzte Woche
0
Letzter Monat
0
geprüft am 17.05.2024

Google ScholarTM

Prüfen

Altmetric