2014
DOI: 10.1142/s0218216514500187
|View full text |Cite
|
Sign up to set email alerts
|

Two-loop part of the rational homotopy of spaces of long embeddings

Abstract: Abstract. Arone and Turchin defined graph-complexes computing the rational homotopy of the spaces of long embeddings. The graph-complexes split into a direct sum by the number of loops in graphs. In this paper we compute the homology of its two-loop part.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
26
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(27 citation statements)
references
References 7 publications
1
26
0
Order By: Relevance
“…For our purposes, working with co-invariants seems to be more suitable. In fact, the generating set for H 1 (C, d 0 ) that we determine in Section 2.3 contains fewer elements than the one given in [5].…”
Section: 2mentioning
confidence: 96%
See 2 more Smart Citations
“…For our purposes, working with co-invariants seems to be more suitable. In fact, the generating set for H 1 (C, d 0 ) that we determine in Section 2.3 contains fewer elements than the one given in [5].…”
Section: 2mentioning
confidence: 96%
“…a certain kind of embeddings R m ֒→ R N . While the cohomology of the tree-and one-loop part of this complex was computed in [2], the cohomology of the two-loop part was established in [5]. In this section, we recall the results on the two-loop part from which we will later deduce our main theorem.…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…This implies that the spectral sequence associated with the induced filtration in the graphcomplex GC r F has as its first term H(GC H(F ) ). Applying this general construction to HGC r,h m,n described as (16)- (19) and knowing the fact that the homology of CH h An−m−2 is concentrated only in two degrees, see Section 2.3.2, we get the statements (6) and (7) of the theorem.…”
Section: Proof Of Theoremmentioning
confidence: 96%
“…This in particular means that the splitting HGC 2,h m,n = HGC 2,h,I m,n ⊕ HGC 2,h,II m,n of Theorem 1 is trivial in homology in the sense that one of the two terms of the splitting is always acyclic. Computations made in [7], specifically its [7, Theorems 6.1 and 6.2], imply…”
Section: Hairy Graph-homology In the Loop Order R =mentioning
confidence: 99%