2000 character limit reached
The 11-loop graph cohomology (2508.13724v1)
Published 19 Aug 2025 in math.QA and math.AT
Abstract: 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 counterexample to a strong version of the conjecture.
Collections
Sign up for free to add this paper to one or more collections.