We deal with monomial ideals of mixed products to which it is possible associate a graph, the so-called generalized graph ideals; their generators are square-free monomials of fixed degree depending only on the graph. The problem is that to determine, in low degree q , the paths of length q-1 of any simple connected graph G and the generators of the corresponding generalized graph ideal I_q(G), through combinatorial calculations made only on the incidence matrix of G. Such a problem is fully solved for generalized graph ideals in degree less than 5; in these cases the number and the structure of the generators of that ideals are computed.

q-PATHS OF A GRAPH AND INCIDENCE MATRIX

Abstract

We deal with monomial ideals of mixed products to which it is possible associate a graph, the so-called generalized graph ideals; their generators are square-free monomials of fixed degree depending only on the graph. The problem is that to determine, in low degree q , the paths of length q-1 of any simple connected graph G and the generators of the corresponding generalized graph ideal I_q(G), through combinatorial calculations made only on the incidence matrix of G. Such a problem is fully solved for generalized graph ideals in degree less than 5; in these cases the number and the structure of the generators of that ideals are computed.
Scheda breve Scheda completa Scheda completa (DC)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/11570/1721839`
Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

• ND
• ND
• ND