ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a simple graph on nn vertices, let k\Bbbk be a field, and set R=k[x1,…,xn,y1,…,yn]R=\Bbbk[x_{1},\ldots,x_{n},y_{1},\ldots,y_{n}]. For {i,j}∈E(G)\{i,j\}\in E(G), write fi,j=xiyj−xjyif_{i,j}=x_{i}y_{j}-x_{j}y_{i}, define the binomial edge ideal

JG=({fi,j∣{i,j}∈E(G)})⊆R,J_G=(\{f_{i,j}\mid \{i,j\}\in E(G)\})\subseteq R,

and set RG=R/JGR_G=R/J_G. A graph is weakly closed as in Matsuda's definition. Assume that the characteristic of k\Bbbk is two. Matsuda's conjecture. GG is weakly closed if and only if RGR_G is F-pure. Matsuda proved the forward implication, while the converse was conjectured and is proved in the source paper; thus the conjecture is solved.

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.