The present work deals with term orders descending from polyhedral geometry and combinatorial algebra, in particular the sorted and the generalized bi-sorted order, which are defined starting respectively from monomials in one and in two sets of variables. Edge ideals of graphs that derive from a monomial algebra [] are characterized, a field and a minimal set of generators of an ideal of Veronese-type or an ideal of mixed products. Finally, a concrete example concerning the field of security is discussed.
Drawing of graphs linked to monomial algebras
M. Imbesi;M. La Barbiera
In corso di stampa
Abstract
The present work deals with term orders descending from polyhedral geometry and combinatorial algebra, in particular the sorted and the generalized bi-sorted order, which are defined starting respectively from monomials in one and in two sets of variables. Edge ideals of graphs that derive from a monomial algebra [] are characterized, a field and a minimal set of generators of an ideal of Veronese-type or an ideal of mixed products. Finally, a concrete example concerning the field of security is discussed.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
