Glicci simplicial complexes

DC ElementWertSprache
dc.contributor.authorNagel, Uwe
dc.contributor.authorRoemer, Tim
dc.date.accessioned2021-12-23T16:06:49Z-
dc.date.available2021-12-23T16:06:49Z-
dc.date.issued2008
dc.identifier.issn00224049
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/7567-
dc.description.abstractThis note is a case study for the potential of liaison-theoretic methods to applications in Combinatorics. One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this question for Stanley-Reisner ideals defined by simplicial complexes that are weakly vertex-decomposable. This class of complexes includes matroid, shifted and Gorenstein complexes respectively. Moreover, we construct a simplicial complex which shows that the property of being glicci depends on the characteristic of the base field. As an application of our methods we establish new evidence for two conjectures of Stanley on partitionable complexes and Stanley decompositions. (c) 2008 Elsevier B.V. All rights reserved.
dc.language.isoen
dc.publisherELSEVIER
dc.relation.ispartofJOURNAL OF PURE AND APPLIED ALGEBRA
dc.subjectGORENSTEIN LIAISON
dc.subjectIDEALS
dc.subjectMathematics
dc.subjectMathematics, Applied
dc.titleGlicci simplicial complexes
dc.typejournal article
dc.identifier.doi10.1016/j.jpaa.2008.03.005
dc.identifier.isiISI:000257351900010
dc.description.volume212
dc.description.issue10
dc.description.startpage2250
dc.description.endpage2258
dc.identifier.eissn18731376
dc.publisher.placeRADARWEG 29, 1043 NX AMSTERDAM, NETHERLANDS
dcterms.isPartOf.abbreviationJ. Pure Appl. Algebr.
dcterms.oaStatusGreen Submitted, Bronze
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidRoTi119-
Zur Kurzanzeige

Seitenaufrufe

4
Letzte Woche
1
Letzter Monat
0
geprüft am 24.05.2024

Google ScholarTM

Prüfen

Altmetric