Ideals arising from graphs are investigated via Groebner bases theory in order to introduce algebraic objects useful for applications related to the field of security. In particular, the notion of s-sequence for the generators of the edge ideal I(G) of any graph G is considered, so that a description of the Groebner basis for the relation ideal J of the symmetric algebra of I(G) can be obtained. Based on this approach, the initial ideal of J with respect to a monomial order is well-determined and defines the edge ideal of a supporting graph F, essential in transmitting protected data.
EDGE IDEALS AND CONNECTION PROBLEMS
LA BARBIERA, MONICA
2010-01-01
Abstract
Ideals arising from graphs are investigated via Groebner bases theory in order to introduce algebraic objects useful for applications related to the field of security. In particular, the notion of s-sequence for the generators of the edge ideal I(G) of any graph G is considered, so that a description of the Groebner basis for the relation ideal J of the symmetric algebra of I(G) can be obtained. Based on this approach, the initial ideal of J with respect to a monomial order is well-determined and defines the edge ideal of a supporting graph F, essential in transmitting protected data.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
