ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite simple graph, let JGJ_G denote its binomial edge ideal, and let CnC_n denote the cycle graph on nn vertices. Let R(JG)\mathcal{R}(J_G) be the Rees algebra of JGJ_G, and let Rs(JCn)\mathcal{R}_s(J_{C_n}) denote the symbolic Rees algebra of JCnJ_{C_n}. Conjecture. If GG is a tree or a unicyclic graph, then JGJ_G is of linear type. Moreover,

Rs(JCn)=R(JCn).\mathcal{R}_s(J_{C_n})=\mathcal{R}(J_{C_n}).

These claims arise from experimental evidence in the study of binomial edge ideals and their Rees algebras. The surrounding discussion also asks for a classification of all bipartite graphs whose binomial edge ideals are of linear type; the conjectured assertions provide two proposed classes of examples and a symbolic-Rees-algebra equality, with no resolution supplied here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.