Photo from wikipedia
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… Click to show full 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.
Keywords:
edge ideals;
ideals block;
block graphs;
regularity;
binomial edge
Journal Title: Journal of Algebra and Its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Algebra and Its Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!