The weak-closedness characterization of F-purity for binomial edge ideals in characteristic 2
The weak-closedness characterization of F-purity for binomial edge ideals in characteristic 2
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.
Sources & referencesView supporting material
Primary source
Kazunori Matsuda, “Weakly closed graphs and F-purity of binomial edge ideals”, arXiv:1209.4300 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.