paper

Hilbert Coefficients and Regularity of Binomial Edge Ideals

arXiv:2512.02590

Abstract

Let be a simple graph on vertices, and let denotes the corresponding binomial edge ideal in , where is a field. We show that if a vertex satisfies a certain degree condition, then some Hilbert coefficients remain unchanged upon its removal, thereby providing a reduction technique for computing Hilbert coefficients. As an application, for any and a pair with , we show that there always exists a graph such that and , where and denote the Castelnuovo-Mumford regularity and the -th Hilbert coefficient of , respectively. In particular, this demonstrates that there is no inherent relationship between the regularity and the Hilbert coefficients for the class of binomial edge ideals.

16 pages. Comments are welcome!

Hilbert Coefficients and Regularity of Binomial Edge Ideals · wovepaper