2017
DOI: 10.1007/s11005-017-0964-9
|View full text |Cite
|
Sign up to set email alerts
|

Differentials on graph complexes II: hairy graphs

Abstract: Abstract. We study the cohomology of the hairy graph complexes which compute the rational homotopy of embedding spaces, generalizing the Vassiliev invariants of knot theory. We provide spectral sequences converging to zero whose first pages contain the hairy graph cohomology. Our results yield a way to construct many hairy graph cohomology classes out of non-hairy classes by a mechanism which we call the waterfall mechanism. By this mechanism we can construct many previously unknown classes and provide a first… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
17
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(19 citation statements)
references
References 17 publications
2
17
0
Order By: Relevance
“…These complexes compute the rational homotopy of the spaces of embeddings of disks modulo immersions, fixed at the boundary, Emb ∂ (D m , D n ), provided that n − m ≥ 3, cf. [2,1,10,4]. In this context, Willwacher conjectured our result in [11].…”
Section: Introductionsupporting
confidence: 66%
See 1 more Smart Citation
“…These complexes compute the rational homotopy of the spaces of embeddings of disks modulo immersions, fixed at the boundary, Emb ∂ (D m , D n ), provided that n − m ≥ 3, cf. [2,1,10,4]. In this context, Willwacher conjectured our result in [11].…”
Section: Introductionsupporting
confidence: 66%
“…It is SE f ix Φ i = 0, so g i : SE f ix Φ i−1 → 0 is a quasi-isomorphism. 4. The same as (3) but x = Φ + (a i ) gives the analogous result.…”
mentioning
confidence: 67%
“…Using this isomorphism, we easily obtain the following generalizations of statements of Theorems 3.1 and 3.2: Theorem 3.7 Let d be any even integer and v 4m+1−d be a symbol of degree 4m + 1 − d. The natural embeddings [2], [6], [8], [16], [17], [27], [28], [29] for more details about these families of graph complexes and their generalizations. For odd d, the directions on edges play a special role.…”
Section: The Version Dfgc D For An Arbitrary Even Dimension Dmentioning
confidence: 99%
“…Graph complexes provide us with a large supply of intriguing questions and conjectures 1 [3], [5], [6], [8], [9], [13], [14], [16], [17], [19], [20], [26], [27], [28], [29]. One source of the motivation for working with graph complexes comes from the study of embedding spaces [2], [4], [21], [25], [26].…”
Section: Introductionmentioning
confidence: 99%
“…is given by the operator (12). Finally, the odd number d matters only in providing a global degree shift.…”
Section: Evenmentioning
confidence: 99%