2000 character limit reached
Differentials on graph complexes
Published 10 Nov 2014 in math.QA | (1411.2369v2)
Abstract: We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used to show the existence of an infinite series of previously unknown and provably non-trivial cohomology classes, and put constraints on the structure of the graph cohomology as a whole.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.