Regularity bound by the h-polynomial degree for binomial edge ideals

Let GG be a finite simple graph on the vertex set [n]={1,,n}[n]=\{1,\ldots,n\}, let K[x,y]=K[x1,,xn,y1,,yn]K[\boldsymbol{x},\boldsymbol{y}]=K[x_1,\ldots,x_n,y_1,\ldots,y_n] be the standard graded polynomial ring over a field KK, and let JGJ_G be the binomial edge ideal generated by xiyjxjyix_i y_j-x_j y_i for the edges {i,j}\{i,j\} of GG. Write

hK[x,y]/JG(λ)=h0+h1λ++hsλsh_{K[\boldsymbol{x},\boldsymbol{y}]/J_G}(\lambda)=h_0+h_1\lambda+\cdots+h_s\lambda^s

for the hh-polynomial of K[x,y]/JGK[\boldsymbol{x},\boldsymbol{y}]/J_G, and let reg\operatorname{reg} denote Castelnuovo--Mumford regularity. Regularity–hh-degree conjecture. One has

reg(K[x,y]/JG)deghK[x,y]/JG(λ).\operatorname{reg}(K[\boldsymbol{x},\boldsymbol{y}]/J_G)\leq \deg h_{K[\boldsymbol{x},\boldsymbol{y}]/J_G}(\lambda).

Equality is known when the quotient is Cohen--Macaulay, but the inequality is supported here only by computational experience and remains open in general.

Sources & referencesView supporting material

Primary source

Takayuki Hibi and Kazunori Matsuda, “Regularity and h-polynomials of binomial edge ideals”, arXiv:1808.06984 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.