Trivalent partner conjecture for loop graphs in odd graph cohomology
Trivalent partner conjecture for loop graphs in odd graph cohomology
Let be the graph complex, and let denote its loop graphs. The partner classes are those classes killed by the loop graphs in the spectral sequence described in the source. Trivalent partner conjecture. The classes killed by the loop graphs are linear combinations of trivalent graphs; equivalently, the corresponding classes live in degree in . The conjecture concerns the currently unknown partners of the loop graphs; the source reports that computationally found non-loop classes occur in degrees and , and gives no resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Anton Khoroshkin, Thomas Willwacher and Marko Živković, “Differentials on graph complexes”, arXiv:1411.2369 (2015).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.