Krull dimension and regularity of binomial edge ideals of block graphs

DOI10.1142/S0219498820501339MaRDI QIDQ3303798zbMATH OpenOpenAlexWikidataFDO

Authors Carla Mascia, Giancarlo Rinaldo

Publication date 4 August 2020

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.01239

zbMATH Keywords

binomial edge idealblock graphsCastelnuovo-Mumford regularityKrull dimension

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Syzygies, resolutions, complexes and commutative rings (13D02) Commutative rings defined by binomial ideals, toric rings, etc. (13F65) Computational aspects and applications of commutative rings (13P99)

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.

Recommendations

• Binomial edge ideals of generalized block graphs
• On the binomial edge ideals of block graphs
• Binomial edge ideals and bounds for their regularity
• Regularity bounds for binomial edge ideals
• Regularity of binomial edge ideals of certain block graphs

Cites work

• An upper bound for the regularity of binomial edge ideals of trees
• Binomial edge ideals and conditional independence statements
• Binomial edge ideals of regularity 3
• Cohen-Macaulay binomial edge ideals
• Cohen-Macaulay binomial edge ideals of small deviation
• Cohen–Macaulay binomial edge ideals of cactus graphs
• Construction of Cohen-Macaulay binomial edge ideals
• Graphs and ideals generated by some 2-minors
• Introduction to algorithms
• Monomial Ideals
• On the binomial edge ideal of a pair of graphs
• On the extremal Betti numbers of binomial edge ideals of block graphs
• On the regularity of binomial edge ideals
• Regularity bounds for binomial edge ideals
• Regularity of binomial edge ideals of certain block graphs
• The Castelnuovo-Mumford regularity of binomial edge ideals

Cited in

(10)

• Binomial edge ideals and bounds for their regularity
• Local cohomology of binomial edge ideals and their generic initial ideals
• Regularity of powers of quadratic sequences with applications to binomial ideals
• On the binomial edge ideals of block graphs
• Regularity of parity binomial edge ideals
• Binomial edge ideals of unicyclic graphs
• Binomial edge ideals of generalized block graphs
• An upper bound for the regularity of binomial edge ideals of trees
• d-sequence edge binomials, and regularity of powers of binomial edge ideals of trees
• Binomial edge ideals of trees

Describes a project that uses

Uses Software

• CoCoA
• Macaulay2

This page was built for publication: Krull dimension and regularity of binomial edge ideals of block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303798)