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.
Titolo: | EDGE IDEALS AND CONNECTION PROBLEMS |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
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. |
Handle: | http://hdl.handle.net/11570/1909445 |
Appare nelle tipologie: | 14.a.1 Articolo su rivista |
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.