2000 character limit reached
From configuration spaces to graph complexes via FA-modules
Published 3 Sep 2026 in math.AT | (2609.04033v1)
Abstract: Work of Gadish and Hainaut (after Petersen) models the compactly supported cohomology of a wedge of circles as a polynomial functor. We identify the coefficients of this functor, , via a cobar construction of -modules. This identification formally implies that these coefficients will arise in computations of graph homology, and we use this result to give examples of graph complexes whose homology may be embedded in . This includes the Payne-Willwacher marked graph complex in genus 2, for which we give a new, explicit decomposition in terms of simple -modules. This allows us to describe as the cohomology of a complex of decorated trees and to show, for example, .
Paper Prompts
Sign up for free to create and run prompts on this paper.