3 papers
math.QA2025
The 11-loop graph cohomology
Thomas Willwacher
We compute the Kontsevich graph cohomology in loop order 11, and for some degrees in higher loop order. We apply our results to discuss a conjecture of F. Brown, providing a counte…
math.QA2025
On the bridgeless graph complex
Thomas Willwacher
We discuss the cohomology of the bridgeless graph complex, that is, the subcomplex of the Kontsevich graph complex spanned by bridgeless graphs.
math.QA2025
The triconnected Kontsevich graph complex
Thomas Willwacher
We show that a smaller version of the Kontsevich graph complex spanned by triconnected graphs is quasi-isomorphic to the full Kontsevich graph complex.