Krull dimension and regularity of binomial edge ideals of block graphs
Commutative Algebra
2019-08-05 v5 Combinatorics
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 a linear time algorithm to compute the Castelnuovo-Mumford regularity and Krull dimension of binomial edge ideals of block graphs.
Keywords
Cite
@article{arxiv.1803.01239,
title = {Krull dimension and regularity of binomial edge ideals of block graphs},
author = {Carla Mascia and Giancarlo Rinaldo},
journal= {arXiv preprint arXiv:1803.01239},
year = {2019}
}
Comments
Accepted in Journal of Algebra and Application