2023
DOI: 10.1007/s00029-023-00830-5
|View full text |Cite
|
Sign up to set email alerts
|

Stable cohomology of graph complexes

Abstract: We study three graph complexes related to the higher genus Grothendieck–Teichmüller Lie algebra and diffeomorphism groups of manifolds. We show how the cohomology of these graph complexes is related, and we compute the cohomology as the genus g tends to $$\infty $$ ∞ . As a byproduct, we find that the Malcev completion of the genus g mapping class group relative to the symplectic group is Koszul in the stable limit, partially answering a question of Hain.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
4
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 24 publications
1
4
0
Order By: Relevance
“…We also prove that Gr • LCS 𝔱 𝑔 and Gr • LCS 𝔱 1 𝑔 are Koszul in the same range, as well as the relative unipotent completions Gr • LCS 𝔲 𝑔 , Gr • LCS 𝔲 1 𝑔 and Gr • LCS 𝔲 𝑔,1 (see Section 3.1.1 for detailed definitions). This result for Gr • LCS 𝔲 𝑔 has simultaneously been obtained by Felder-Naef-Willwacher [FNW23]; we discuss the relation between the arguments in Remark 7.4.…”
Section: Theorem a The Lie Algebra Gr •supporting
confidence: 74%
See 4 more Smart Citations
“…We also prove that Gr • LCS 𝔱 𝑔 and Gr • LCS 𝔱 1 𝑔 are Koszul in the same range, as well as the relative unipotent completions Gr • LCS 𝔲 𝑔 , Gr • LCS 𝔲 1 𝑔 and Gr • LCS 𝔲 𝑔,1 (see Section 3.1.1 for detailed definitions). This result for Gr • LCS 𝔲 𝑔 has simultaneously been obtained by Felder-Naef-Willwacher [FNW23]; we discuss the relation between the arguments in Remark 7.4.…”
Section: Theorem a The Lie Algebra Gr •supporting
confidence: 74%
“…Up to a change of degrees the chain complex may be identified with the sum of the graph complexes studied by Chan–Galatius–Payne [CGP21, CGP22]. When , this is predual to Kontsevich’s graph complex as studied by Willwacher [Wil15], and for general S it is predual to the ‘hairy graph complex’ of Andersson–Willwacher–Zivkovic [AWZ20].…”
Section: Applications Of Koszulnessmentioning
confidence: 99%
See 3 more Smart Citations