Morita's nontriviality conjecture for graph homology classes

For each integer k1k\geq 1, let [μk][\mu_k] denote the Morita homology class in

H(FG02k+2-loop(0)).H\bigl(\mathsf{FG}_0^{2k+2\text{-loop}}(0)\bigr).

Morita's conjecture. The Morita homology classes [μk]H(FG02k+2(0))[\mu_k]\in H\bigl(\mathsf{FG}_0^{2k+2}(0)\bigr) are non-trivial for every k1k\geq 1. These classes are part of an infinite family in forested graph homology; the supplied text gives no evidence that nontriviality is known for every kk.

Sources & referencesView supporting material

Primary source

Simon Brun and Thomas Willwacher, “Graph homology computations”, arXiv:2307.12668 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.