Matchings in simplicial complexes, circuits and toric varieties

dc.contributor.authorKatsabekis, A.en
dc.contributor.authorThoma, A.en
dc.date.accessioned2015-11-24T17:25:13Z
dc.date.available2015-11-24T17:25:13Z
dc.identifier.issn0097-3165-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13007
dc.rightsDefault Licence-
dc.subjectchromatic numberen
dc.subjectclique complexen
dc.subjectcircuitsen
dc.subjectlattice idealsen
dc.subjectmatchingsen
dc.subjectsimplicial complexen
dc.subjecttoric varietiesen
dc.titleMatchings in simplicial complexes, circuits and toric varietiesen
heal.abstractUsing a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties. (c) 2006 Elsevier Inc. All rights reserved.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.identifier.primaryDOI 10.1016/j.jcta.2006.05.005-
heal.identifier.secondary<Go to ISI>://000244320600007-
heal.identifier.secondaryhttp://ac.els-cdn.com/S0097316506000793/1-s2.0-S0097316506000793-main.pdf?_tid=302d723569af93e9e2279578c4fa45b1&acdnat=1338462009_c69ad5c931d537477f214422c8637bd2-
heal.journalNameJournal of Combinatorial Theory Series Aen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2007-
heal.publisherElsevieren
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: