On a regularity-conjecture of generalized binomial edge ideals

DOI10.1007/S13348-024-00452-WMaRDI QIDQ6937002zbMATH OpenFDO

Authors J. Anuvinda, Ranjana Mehta, Kamalesh Saha

Publication date 28 August 2025

Published in Collectanea Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13348-024-00452-W

zbMATH Keywords

\(r\)-compatible mapsCastelnuovo-Mumford regularityclique disjoint edge setsgeneralized binomial edge ideals

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of commutative algebra (05E40) Other special types of modules and ideals in commutative rings (13C13) Syzygies, resolutions, complexes and commutative rings (13D02) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)

Review text

The paper addresses the problem concerning the Castelnuovo-Mumford regularity of generalized binomial edge ideals, a class of binomial ideals introduced by \textit{J. Rauh} [Adv. Appl. Math. 50, No. 3, 409--414 (2013; Zbl 1263.13033)] that extends binomial edge ideals. Regularity bounds for such ideals are important because they control the complexity of minimal free resolutions and connect to the combinatorics of the underlying graph. A conjecture by \textit{S. S. Madani} and \textit{D. Kiani} [Electron. J. Comb. 20, No. 1, Research Paper P48, 13 p. (2013; Zbl 1278.13007)] proposed an upper bound for the regularity of generalized binomial edge ideals, which was solved for the chordal graphs by \textit{A. Kumar} [J. Algebra 546, 357--369 (2020; Zbl 1433.13013)]. The authors settle this conjecture in full generality and, in fact, they obtain a strictly stronger upper bound. They introduce a refined notion of an \(r\)-compatible map and show that it yields a uniform upper bound given combinatorially, in terms of the maximal size of a clique-disjoint edge set of the graph. This bound improves all previously known results, including those for chordal graphs and for the classical binomial edge ideals. The authors also construct an infinite class of block graphs for which their bound is attained. Overall, the paper gives a complete solution to the regularity conjecture, providing a combinatorial bound.

Cites work

• A proof for a conjecture on the regularity of binomial edge ideals
• Binomial edge ideals and conditional independence statements
• Binomial edge ideals: a survey
• Cohen-Macaulay binomial edge ideals
• Generalized binomial edge ideals
• Graphs and ideals generated by some 2-minors
• scientific article; zbMATH DE number 1182838 (Why is no real title available?)
• scientific article; zbMATH DE number 2019938 (Why is no real title available?)
• Ideals of adjacent minors
• Koszul binomial edge ideals of pairs of graphs
• On the binomial edge ideal of a pair of graphs
• On the generalized binomial edge ideals of generalized block graphs
• Primary decomposition of lattice basis ideals
• Regularity bound of generalized binomial edge ideal of graphs
• Regularity of binomial edge ideals of certain block graphs
• The binomial edge ideal of a pair of graphs

Cited in

(1)

• Castelnuovo-Mumford regularity of generalized binomial edge ideals of graphs

This page was built for publication: On a regularity-conjecture of generalized binomial edge ideals

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