We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover, we present linear time algorithms to compute the Castelnuovo-Mumford regularity and the Krull dimension of binomial edge ideals of block graphs.
Krull dimension and regularity of binomial edge ideals of block graphs
Rinaldo G.
2020-01-01
Abstract
We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover, we present linear time algorithms to compute the Castelnuovo-Mumford regularity and the Krull dimension of binomial edge ideals of block graphs.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.