2021
DOI: 10.48550/arxiv.2110.05711
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Weight two compactly supported cohomology of moduli spaces of curves

Abstract: We study the weight 2 graded piece of the compactly supported rational cohomology of the moduli spaces of curves M g,n and show that this can be computed as the cohomology of a graph complex that is closely related to graph complexes arising in the study of embedding spaces. For n = 0, we express this cohomology in terms of W 0 H • c (M g ′ ,n ′ ) for g ′ ≤ g and n ′ ≤ 2, and thereby produce several new infinite families of nonvanishing unstable cohomology groups on M g , including the first such families in o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(9 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…Let g and n be non-negative integers. The graph complex G pg,nq studied in [5,19] is generated by connected graphs of genus g with no loop edges and no vertices of valence 2. The vertices of valence 1 are called external, and the other vertices are internal.…”
Section: Graph Complexes Associated To Moduli Spaces Of Curvesmentioning
confidence: 99%
See 4 more Smart Citations
“…Let g and n be non-negative integers. The graph complex G pg,nq studied in [5,19] is generated by connected graphs of genus g with no loop edges and no vertices of valence 2. The vertices of valence 1 are called external, and the other vertices are internal.…”
Section: Graph Complexes Associated To Moduli Spaces Of Curvesmentioning
confidence: 99%
“…The graph complexes X g,n and weight two compactly supported cohomology of M g,n . The main result of [19] is the identification of gr 2 H ‚ c pM g,n q with the cohomology of a graph complex X g,n that is close to graph complexes arising in knot theory and the embedding calculus. We shall use this identification to show our main Theorem 1.1, by computing the Euler characteristic of X g,n .…”
Section: Graph Complexes With One Special Vertexmentioning
confidence: 99%
See 3 more Smart Citations