Matsuda's weakly closed graph characterization of F-purity
Statement
Let be a simple graph on vertices, let be a field, and set . For , write , define the binomial edge ideal
and set . A graph is weakly closed as in Matsuda's definition. Assume that the characteristic of is two. Matsuda's conjecture. is weakly closed if and only if 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.