Graph cohomology and Kontsevich cycles
Kiyoshi Igusa

TL;DR
This paper explores the relationship between graph cohomology, Kontsevich cycles, and Miller-Morita-Mumford classes, providing methods to compute polynomial coefficients using Stasheff polyhedra and previous results.
Contribution
It introduces a novel approach to compute coefficients of polynomials in the cohomology of mapping class groups via graph homology and polyhedral techniques.
Findings
Coefficients of Kontsevich cycles can be computed using Stasheff polyhedra.
Establishes a connection between graph cohomology and Miller-Morita-Mumford classes.
Provides explicit computational methods for these polynomial coefficients.
Abstract
The dual Kontsevich cycles in the double dual of associative graph homology correspond to polynomials in the Miller-Morita-Mumford classes in the integral cohomology of mapping class groups. I explain how the coefficients of these polynomials can be computed using Stasheff polyhedra and results from my previous paper GT/0207042.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Topological and Geometric Data Analysis · Algebraic structures and combinatorial models
