2019
DOI: 10.1007/s10468-019-09875-7
|View full text |Cite
|
Sign up to set email alerts
|

The Cohomology of the Full Directed Graph Complex

Abstract: In his seminal paper "Formality conjecture", M. Kontsevich introduced a graph complex GC1ve closely connected with the problem of constructing a formality quasi-isomorphism for Hochschild cochains. In this paper, we express the cohomology of the full directed graph complex dfGC explicitly in terms of the cohomology of GC1ve. Applications of our results include a recent work by the first author which completely characterizes homotopy classes of formality quasi-isomorphisms for Hochschild cochains in the stable … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 29 publications
0
7
0
Order By: Relevance
“…45 See [71, Appendix K] for the first item (cf. also [13]), [72] for the second and [73] for the third. 46 The first Betti number is defined as b := k − N + 1 for a connected graph with N vertices and k edges.…”
Section: The Inclusionmentioning
confidence: 91%
See 1 more Smart Citation
“…45 See [71, Appendix K] for the first item (cf. also [13]), [72] for the second and [73] for the third. 46 The first Betti number is defined as b := k − N + 1 for a connected graph with N vertices and k edges.…”
Section: The Inclusionmentioning
confidence: 91%
“…directed) graphs. 48 See [13,71] for the first arrow and [47] for a general statement. 49 The cocycle L3 stands for the triangle loop 2 1…”
Section: The Inclusionmentioning
confidence: 99%
“…A proof of Theorem 4.28 for 𝔇𝔊 𝑚 (𝒞) instead of 𝔇𝔊 𝑚 trunc (𝒞) has been sketched by Willwacher [Wil14, Appendix K] (in the case of the commutative cyclic operad 𝒞 = 𝒞om). Other related statements have been proven in detail by Živković[Živ20] and Dolgushev-Rogers[DR19]. We quickly survey what is known about the homology of the undirected graph complex 𝔘𝔊 𝑚 (ℒie) associated to the cyclic Lie operad.…”
mentioning
confidence: 81%
“…Although less ubiquitous than undirected graph complexes, directed versions have appeared in the literature before; see, for example, [Wil14, Živ20, DR19]. Surprisingly, it turns out that the homology of the truncated directed graph complex is actually isomorphic to the one of .…”
Section: Introductionmentioning
confidence: 99%
“…33 Here, fcGC d stands for the usual Kontsevich graph complex of connected undirected graphs. 34 See [56,10] for the first arrow and [39] for a general statement. 35 The first Betti number is defined as b := k − N + 1 for a connected graph with N vertices and k edges.…”
Section: Table 2: Cohomology In Low Dimension and Degreementioning
confidence: 99%