Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13245
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCharalambous, H.en
dc.contributor.authorThoma, A.en
dc.date.accessioned2015-11-24T17:26:44Z-
dc.date.available2015-11-24T17:26:44Z-
dc.identifier.issn0021-8693-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13245-
dc.rightsDefault Licence-
dc.subjectresolutionsen
dc.subjectlattice idealen
dc.subjectsyzygiesen
dc.subjectindispensable syzygiesen
dc.subjectscarf complexen
dc.subjectconditional distributionsen
dc.subjectminimal systemsen
dc.subjectresolutionsen
dc.subjectgeneratorsen
dc.subjectsemigroupen
dc.subjectsyzygiesen
dc.titleOn the generalized Scarf complex of lattice idealsen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primaryDOI 10.1016/j.jalgebra.2009.12.019-
heal.identifier.secondary<Go to ISI>://000274598200001-
heal.identifier.secondaryhttp://ac.els-cdn.com/S0021869309006838/1-s2.0-S0021869309006838-main.pdf?_tid=52d093c7c730ef6b59ffb33ffc3036ed&acdnat=1338461983_86f95552fbee1333a31e964240d49ef3-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.publicationDate2010-
heal.abstractLet k be a field, L subset of Z(n) be a lattice such that L boolean AND N(n) = {0}, and I(L) subset of R = k[x(1), ... , x(n)] the corresponding lattice ideal. We present the generalized Scarf complex of I(L) and show that it is indispensable in the sense that it is contained in every minimal free resolution of R/I(L). (C) 2009 Elsevier Inc. All rights reserved.en
heal.publisherElsevieren
heal.journalNameJournal of Algebraen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Charalambous-2010-On the generalized S.pdf249.23 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons