The weak-closedness characterization of F-purity for binomial edge ideals in characteristic 2
Statement
Let be a graph, let be the polynomial ring associated with , and let be its binomial edge ideal. Assume that .
Weak-closedness characterization. The quotient is -pure if and only if is weakly closed.
The preceding theorem proves the implication from weak closedness to -purity for arbitrary . The converse, and hence the equivalence in characteristic , was verified in the source for graphs with at most six vertices using Macaulay2, but remains conjectural in general.
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.