38
The Intricate Maze of Graph Complexes Vasily Dolgushev Temple University During the spring of 2016, V.D. is a visitor at the University of Pennsylvania. Vasily Dolgushev (Temple University) Graph Complexes 1 / 38

The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Embed Size (px)

Citation preview

Page 1: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The Intricate Maze of Graph Complexes

Vasily Dolgushev

Temple University

During the spring of 2016, V.D. is a visitor at the University of Pennsylvania.

Vasily Dolgushev (Temple University) Graph Complexes 1 / 38

Page 2: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The cochain complex assembled from planar trees

The cochain complex C•PT,n consists of linear combinations1 of rootedplanar trees with n labeled leaves (and without bivalent vertices):

v =

1

3 2 4

− 726

2 3

4 1

The degree of such tree := − number of internal (i.e. blue) edges.The differential ∂ is defined as the sum over all possible contractions ofinternal edges (with appropriate sign factors).

1The base field K has characteristic zero.Vasily Dolgushev (Temple University) Graph Complexes 2 / 38

Page 3: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

For example,

The above vector v has degree −1 and

∂v =

3 2 4 1

− 726

2 3 4 1

It is not hard to show that

H i(C•PT,n) =

{K Sn if i = 2− n ,0 otherwise .

A neat topological proof of this fact is based on the use ofStasheff-Tamari polytopes (a.k.a. associahedra).

Vasily Dolgushev (Temple University) Graph Complexes 3 / 38

Page 4: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The cochain complex of brace trees Br(n)

A vector in Br(n) is a linear combination of brace trees:

5

2

1

3 4

− 1979 4

2

3 1

5

∈ Br(5)

The degree of a brace tree T = 2× the number of neutral (black)vertices − the number of non-root edges.The differential ∂(T ) of T is the sum over all possible “splittings” oflabeled and neutral vertices (with appropriate sign factors)

. . .→

. . .

i

. . .→ i

. . .

+ i

. . .

Vasily Dolgushev (Temple University) Graph Complexes 4 / 38

Page 5: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

For example,. . .

1 2 3

=

1 2

3

−1

2 3

∂ 1

2

=

1 2

−2 1

Vasily Dolgushev (Temple University) Graph Complexes 5 / 38

Page 6: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The cohomology of Br(n) is . . .

Theorem

For every n ≥ 2, we have

H•(Br(n)

) ∼= H−•(

Conf(C,n),K),

where Conf(C,n) is the configuration space of n points on C:

Conf(C,n) :={

(z1, z2, . . . , zn) ∈ Cn | zi 6= zj for i 6= j}.

For example, the class of 1

2

+ 2

1

is represented by

the cycle

z1

z1

z2

z2

in Conf(C,2).

Vasily Dolgushev (Temple University) Graph Complexes 6 / 38

Page 7: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The family of graph complexes {GCd}d≥1

We need:a set gran,k , n ≥ 1, k ≥ 0. An element of gran,k is a directedgraph Γ with V (Γ) = {1,2, . . . ,n} and E(Γ) = {1,2, . . . , k}.

1

2

3 4 5

12 3

41 2

1

gran,k is equipped with the action of Sn × (Sk n Sk2 );

the graded vector space

fGCd :=⊕

n≥1, k≥0

(snd−d+(1−d)k Kgran,k ⊗Orn,k

d

)Sn×(SknSk

2 ),

where s is the operator which shifts the degree up by 1 and

Orn,kd :=

{sgnSk

if d is even,sgnSn

⊗(sgnS2)⊗ k if d is odd.

Vasily Dolgushev (Temple University) Graph Complexes 7 / 38

Page 8: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

For example,. . .

In fGC2 (i.e. when d is even), we can forget about directions on edges,discard graphs with multiple edges, identify graphs which differ merelyby the labels on vertices, and keep in mind that, the action of everyodd permutation in Sk alters the sign factor in front of a graph:

1 2 1 2 3

1 2=

2 1 3

1 2= −

1 2 3

2 1

In fGC3 (i.e. when d is odd), we have2

1 2

3

1

23= −

2 1

3

1

23=

1 2

3

1

32= −

1 2

3

1

23

2Multiple edges for fGC3 are allowed.Vasily Dolgushev (Temple University) Graph Complexes 8 / 38

Page 9: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

fGCd is a (graded) Lie algebra

fGCd has the Lie bracket:

[Γ, Γ] := Γ • Γ− (−1)|Γ||Γ|Γ • Γ, Γ • Γ :=n∑

i=1

± Γ ◦i Γ,

Γ ∈ gran,k , Γ ∈ gram,q ,

where ◦i is this operation:

Γ ◦i Γ :=∑

Γ

Γi

Vasily Dolgushev (Temple University) Graph Complexes 9 / 38

Page 10: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

For example,. . .

1

2

3

1

2

3

◦11 2

=1 24

3

4

2

1

3

=

1 4 2

3

4

1

2

3

+2 4 1

3

4

1

2

3

+

1

2

4

3

4

2

1

3+

2

1

4

3

4

2

1

3

If d is odd, we should also keep track of directions on edges andsign factors.

Vasily Dolgushev (Temple University) Graph Complexes 10 / 38

Page 11: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The graph complex GCd

The graph Γe =1 2 satisfies the equation [Γe, Γe] = 0. So we

introduce the differential on fGCd

∂ := [Γe, ] .

DefinitionThe graph complex GCd is the subcomplex of fGCd which involves onlygraphs Γ satisfying these properties:

Γ is connected andeach vertex of Γ has valency ≥ 3.

Vasily Dolgushev (Temple University) Graph Complexes 11 / 38

Page 12: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The “hairy” graph complex hGCj ,d

Let j be an integer. hGCj,d is a modification of GCd which involvesgraphs with a non-empty set of univalent vertices. As the gradedvector space, hGCj,d is⊕

n≥0,m≥1,k

(snd+mj+(1−d)k Khgra(m,n, k)⊗Orm,n,k

j,d

)Sm×Sn×(SknSk

2 ),

where hgram,n,k is the set of connected graphs with the set of univalentvertices {1,2, . . . ,m}, the set of vertices {1,2, . . . ,n} of valency ≥ 3and the set of (directed) edges {1,2, . . . , k}. Finally, Or j,d

m,n,k is a1-dimensional representation of Sm × Sn × (Sk n Sk

2 ) which “takescare” of identifying certain graph with appropriate sign factors.

The differential is defined as the sum of expansions of vertices ofvalency ≥ 3 and keeping only the graphs satisfying our definingconditions.

Vasily Dolgushev (Temple University) Graph Complexes 12 / 38

Page 13: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The degree of a graph in hGCj,d is

d × the number of vertices of val. ≥ 3

+j × the number of univalent vertices + (1− d)× the number of edges.

Examples of identifications in hGCj,d :

1

21 2

31

2

3

4

5= (−1)d

1

22 1

31

2

3

4

5

= (−1)j2

11 2

31

2

3

4

5= (−1)(1−d)

1

21 2

31

2

3

5

4

Vasily Dolgushev (Temple University) Graph Complexes 13 / 38

Page 14: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Example of computing the differential in hGCj ,d

∂1

21 2

31

2

3

4

5 =1

2

1

2 331

2

3

4

5

6

=1

2

1

2

331

2

3

4

5

6 +1

21 2 3

312

3

4

5

6

+

1

21 2 3

31

2

3

4

5

6

Vasily Dolgushev (Temple University) Graph Complexes 14 / 38

Page 15: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

hGC1,3 shows up in knot theory!

A simple combinatorial argument⇒ hGC1,3 lives in degrees ≤ 0.

Furthermore, due to D. Bar-Natan, “On the Vassiliev knot invariants”,

H0(hGC1,3) := hGC01,3/∂(hGC−1

1,3)

is isomorphic to the space CD(S1) of chord diagrams.

Every finite type invariant of framed knots factors through the map

LMΦ : π0(

Embfr (S1,S3))−→ CD(S1).

This map was constructed by M. Kontsevich, T.Q.T. Le and J.Murakami. It is often called the universal Vassiliev invariant.

Vasily Dolgushev (Temple University) Graph Complexes 15 / 38

Page 16: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Topological meaning of hGCj ,d

Due to results of G. Arone, T. Goodwillie, J. R. Klein, M. Kontsevich, P.Lambrechts, J. E. McClure, D. Sinha, J.H. Smith, V. Turchin, I. Volic, M.Weiss, and . . . , the rational homotopy groups

π•(

Embc(Rj ,Rd ))⊗ Q

of the embedding space Embc(Rj ,Rd ) can be expressed in terms ofH•(hGCj,d ) if d ≥ 2j + 2.

For example, R→ R4:

7→

Vasily Dolgushev (Temple University) Graph Complexes 16 / 38

Page 17: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Examples of degree zero cocycles in GC2 are...

γ3 = γ5 = + . . .

γ7 = + . . . and so on.

Here . . . is a linear comb. of graphs with ≥ 2 vertices of valency ≥ 4.

Vasily Dolgushev (Temple University) Graph Complexes 17 / 38

Page 18: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Examples of degree zero cocycles in hGC1,3 are...

w2 = w4 =

w6 = and so on.

Vasily Dolgushev (Temple University) Graph Complexes 18 / 38

Page 19: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

A remark about the Euler characteristic

Let χ be an integer and GCd ,χ (resp. hGCj,d ,χ) be the subcomplex ofGCd (resp. hGCj,d ) spanned by graphs with the Euler characteristic χ.

It is easy to see that

GCd =⊕χ

GCd ,χ , hGCj,d =⊕χ

hGCj,d ,χ .

Moreover, H•(GCd ,χ) is isomorphic (up to a degree shift) to H•(GC2,χ),if d is even, and isomorphic (up to a degree shift) to H•(GC3,χ) if d isodd.

Similarly, H•(hGCj,d ,χ) “depends” (up to a degree shift) only on theparities of j and d . So, for the hairy case, it is sufficient to study onlythese four complexes hGC1,3, hGC2,3, hGC1,2, hGC2,2.

Vasily Dolgushev (Temple University) Graph Complexes 19 / 38

Page 20: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

What do we know about GC2?

Due to T. Willwacher “M. Kontsevich’s graph complex and . . . ”, weknow that

H<0(GC2) = 0 and H0(GC2) ∼= grt as the Lie algebras,

where grt is the Grothendieck-Teichmueller Lie algebra introducedby V. Drinfeld in 1990.It is conjectured that

H1(GC2)?= 0.

Due to results of A. Khoroshkin, T. Willwacher, and M. Zivkovic“Differentials on . . . ” and a theorem of F. Brown, we know that“there are plenty of” cohomology classes in H>1(GC2).

Vasily Dolgushev (Temple University) Graph Complexes 20 / 38

Page 21: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

To define the Lie algebra grt, we need...

The family of Drinfeld Kohno Lie algebras tm, (m ≥ 2) . For everym, tm is generated by {t ij = t ji}1≤i 6=j≤m subject to

[t ij , t ik + t jk ] = 0 #{i , j , k} = 3 ,

[t ij , tkl ] = 0 #{i , j , k , l} = 4 .

and the free Lie algebra lie(x , y) in two symbols x , y .

Vasily Dolgushev (Temple University) Graph Complexes 21 / 38

Page 22: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The Lie algebra grt consists of ...

elements σ(x , y) ∈ lie(x , y) satisfying

σ(y , x) = −σ(x , y) ,

σ(x , y) + σ(y ,−x − y) + σ(−x − y , x) = 0 ,

σ(t23, t34)− σ(t13 + t23, t34) + σ(t12 + t13, t24 + t34)

−σ(t12, t23 + t24) + σ(t12, t23) = 0 .

The Lie bracket on grt is the Ihara bracket:

[σ, σ′]Ih := δσ(σ′)− δσ′(σ) + [σ, σ′]lie(x ,y) ,

where [ , ]lie(x ,y) is the usual bracket on lie(x , y) and δσ is the derivationof lie(x , y) defined by

δσ(x) := 0 , δσ(y) := [y , σ(x , y)] .

Vasily Dolgushev (Temple University) Graph Complexes 22 / 38

Page 23: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Deligne-Drinfeld elements of grt

The above equations have neither linear nor quadratic solutions. Thefirst non-trivial example of an element in grt is

σ3(x , y) = [x , [x , y ]]− [y , [y , x ]] .

More generally,

Proposition (V. Drinfeld, 1990)For every odd integer n ≥ 3 there exists a non-zero vector σn ∈ grt ofdegree n in symbols x and y such that

σn = adn−1x (y) + . . .

where . . . is a sum of Lie words of degrees ≥ 2 in the symbol y .

{σn}n odd ≥3 are called Deligne-Drinfeld elements of grt .

Vasily Dolgushev (Temple University) Graph Complexes 23 / 38

Page 24: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The Deligne-Drinfeld Conjecture states that ...

ConjectureThe Lie algebra grt is freely generated by elements {σn}n odd ≥3 .

Numerical experiments performed by L. Albert, M. Espie, P. Harinck,J.-C. Novelli, G. Racinet, and C. Torossian show that this conjectureholds up to degree 16.

RemarkA result proved by F. Brown in 2011 implies that there exists acollection of Deligne-Drinfeld elements which generates a free Liesubalgebra in grt.

Remark (about grt ∼= H0(GC2))

Willwacher’s isomorphism grt ∼= H0(GC2) sends the elements{σn}n odd ≥3 to the cohomology classes of {γn}n odd ≥3 introducedabove.

Vasily Dolgushev (Temple University) Graph Complexes 24 / 38

Page 25: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

The problem of deformation quantization

Recall that a star product on a smooth manifold M is an R[[ε]]-bilinearassociative multiplication

∗ : C∞(M)[[ε]]⊗ C∞(M)[[ε]]→ C∞(M)[[ε]]

of the formf ∗ g = f · g +

∑k≥1

εkBk (f ,g),

where ε is a formal parameter and Bk are bidifferential operators.

The problem of deformation quantization is to describe equivalenceclasses of such star products on arbitrary manifold M.

Vasily Dolgushev (Temple University) Graph Complexes 25 / 38

Page 26: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Kontsevich’s formality theorem

Let us denote by PV•(M) the algebra of polyvector fields on M. Forexample, PV0(M) = C∞(M) and PV1(M) is the space of vector fields.PV•(M) carries a natural Lie bracket [ , ]S.

In 1997, M. Kontsevich proved that a theorem which implies thatequivalence classes of star products on M are in bijection with(equivalence classes of)

α = εα1 + ε2α2 + · · · ∈ ε PV2(M)[[ε]], [α, α]S = 0.

Such α may be thought of as a generalization of a Poisson structureon M and Kontsevich’s formality quasi-isomorphism may be thought ofa “bridge” connecting classical mechanics to quantum mechanics.

Vasily Dolgushev (Temple University) Graph Complexes 26 / 38

Page 27: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

“Bridges” from classical to quantum mechanics

In my paper “Stable formality quasi-isomorphisms for Hochschildcochains”, I proved a theorem which can be stated colloquially as

Theorem (a colloquial statement!)

The groupexp

(H0(GC2)

)acts simply transitively on the set of bridges connecting classicalmechanics to quantum mechanics.

Combining this result with Willwacher’s theorem, we conclude that

Corollary (a colloquial statement!)The Grothendieck-Teichmueller group exp(grt) acts simply transitivelyon the set of bridges connecting classical mechanics to quantummechanics.

Vasily Dolgushev (Temple University) Graph Complexes 27 / 38

Page 28: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Kontsevich’s conjecture on grt and H•(X ,PVX )

Let X be a smooth algebraic variety over K and PVX be the sheaf ofpolyvector fields on X . In 1999, M. Kontsevich conjectured that the Liealgebra grt acts on

H•(X ,PVX ).

This action is compatible with the cup product. Moreover, the action ofa Deligne-Drinfeld element σn coincides with the action of n-thcomponent Chn(X ) of the Chern character of X .

In paper C. Rogers, T. Willwacher, V.D. “Kontsevich’s graph complex,GRT, and . . . ”, we proved this conjecture. The graph complex GC2 andthe cocycles {γn}n≥3, odd play an important role in the proof of thisconjecture.

Vasily Dolgushev (Temple University) Graph Complexes 28 / 38

Page 29: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Open problems

Problem (∼ to the Deligne-Drinfeld conjecture on grt)

Prove (or disprove) that the Lie algebra H0(GC2) is freely generated bythe cohomology classes {[γn]}n≥3, odd.

Problem (Drinfeld-Kontsevich)

Prove (or disprove) that H1(GC2) = 0.

ProblemDoes the universal Vassiliev invariant distinguish isotopy classes of(framed) knots?

Problem (“Does the universal Vassiliev invariant detect knotorientation?”)Prove (or disprove) that every cocycle in hGC1,3 with an odd number ofhairs is trivial.

Vasily Dolgushev (Temple University) Graph Complexes 29 / 38

Page 30: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

More open problems

ProblemAccording to T.Q.T. Le and J. Murakami, the universal Vassilievinvariant for knots does not depend on the choice of a Drinfeldassociator. Is there an explicit construction of the map

π0(

Embfr (S1,S3))→ CD(S1)

which involves neither Drinfeld associator nor any kind of integration?

ProblemIs there a combinatorial proof of the fact that for every odd n ≥ 3, thereexists a cocycle γn ∈ GC2 which “starts with” the wheel with n spokes(as above)?

Vasily Dolgushev (Temple University) Graph Complexes 30 / 38

Page 31: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Yet two more open problems

ProblemIs there a precise relationship between GCd (or some version of thiscomplex) for even d and GCd (or some version of this complex) for oddd? Can a link between BFV and BV quantizations help us to establishthis relationship?

Problem (Goodwillie-Weiss approach versus the configurationspace integral)Establish a link between the “more direct” configuration space integralapproach (a la Bott-Taubes) to embedding spaces and the approachbased on the functor calculus and formality for operads assembledfrom configuration spaces.

Vasily Dolgushev (Temple University) Graph Complexes 31 / 38

Page 32: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Selected references on graph complexes

[1] J. Conant and K. Vogtmann, On a theorem of Kontsevich, Algebr.Geom. Topol. 3 (2003) 1167–1224.

[2] V.A. Dolgushev and C.L. Rogers, Notes on algebraic operads,graph complexes, and Willwacher’s construction, Mathematicalaspects of quantization, 25–145, Contemp. Math., 583, AMS,Providence, RI, 2012; arXiv:1202.2937.

[3] A. Khoroshkin, T. Willwacher, and M. Zivkovic, Differentials ongraph complexes, arXiv:1411.2369

[4] A. Khoroshkin, T. Willwacher, and M. Zivkovic, Differentials ongraph complexes II - hairy graphs, arXiv:1508.01281

[5] M. Kontsevich, Formal (non)commutative symplectic geometry.The Gelfand Mathematical Seminars, 1990–1992, 173–187,Birkhauser Boston, Boston, MA, 1993.

Vasily Dolgushev (Temple University) Graph Complexes 32 / 38

Page 33: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Further references related to graph complexes

[1] S. Barannikov, Modular operads and Batalin-Vilkovisky geometry,IMRN 19, 2007.

[2] A. Hamilton and A. Lazarev, Graph cohomology classes in theBatalin-Vilkovisky formalism, J. Geom. Phys. 59, 5 (2009)555–575.

[3] E. Getzler, M.M. Kapranov, Modular operads, Compositio Math.110, 1 (1998) 65–126.

[4] K. Igusa, Graph cohomology and Kontsevich cycles, Topology 43,6 (2004) 1469–1510.

[5] M. Kapranov, Rozansky-Witten invariants via Atiyah classes,Compositio Math. 115, 1 (1999) 71–113.

[6] M. Kontsevich, Rozansky-Witten invariants via formal geometry,Compositio Math. 115, 1 (1999) 115–127.

Vasily Dolgushev (Temple University) Graph Complexes 33 / 38

Page 34: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Selected references on grt and finite type knotinvariants

[1] D. Bar-Natan, On the Vassiliev knot invariants, Topology 34, 2(1995) 423–472.

[2] F. Brown, Mixed Tate motives over Z, Ann. of Math. (2) 175, 2(2012) 949–976.

[3] S. Chmutov, S. Duzhin, J. Mostovoy, Introduction to Vassiliev knotinvariants, Cambridge University Press, 2012.

[4] V.A. Dolgushev, C.L. Rogers, and T.H. Willwacher, Kontsevich’sgraph complex, GRT, and the deformation complex of the sheaf ofpolyvector fields, Ann. of Math. (2) 182, 3 (2015) 855–943.

[5] T. Willwacher, M. Kontsevich’s graph complex and theGrothendieck-Teichmueller Lie algebra, Invent. Math. 200, 3(2015) 671–760.

Vasily Dolgushev (Temple University) Graph Complexes 34 / 38

Page 35: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Selected references on embedding spaces

[1] G. Arone and V. Turchin, On the rational homology ofhigh-dimensional analogues of spaces of long knots, Geom.Topol. 18, 3 (2014) 1261–1322.

[2] T.G. Goodwillie and M. Weiss, Embeddings from the point of viewof immersion theory. II, Geom. Topol. 3 (1999)103–118.

[3] B. Munson and I. Volic, Cubical homotopy theory, CambridgeUniversity Press, Cambridge, 2015. 625 pp.

[4] D.P. Sinha, Operads and knot spaces, JAMS 19, 2 (2006)461–486.

[5] M. Weiss, Embeddings from the point of view of immersiontheory. I, Geom. Topol. 3 (1999) 67–101.

Vasily Dolgushev (Temple University) Graph Complexes 35 / 38

Page 36: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Further references on embedding spaces

[1] R. Bott and C. Taubes, On the self-linking of knots, J. Math. Phys.35, 10 (1994) 5247–5287.

[2] A.S. Cattaneo, P. Cotta-Ramusino, and R. Longoni, Configurationspaces and Vassiliev classes in any dimension, Algebr. Geom.Topol. 2 (2002), 949–1000.

[3] W. Dwyer and K. Hess, Long knots and maps between operads,Geom. Topol. 16, 2 (2012) 919–955.

[4] J.E. McClure and J.H. Smith, A solution of Deligne’s Hochschildcohomology conjecture, Contemp. Math., 293, AMS, 2002.

[5] I. Volic, A survey of Bott-Taubes integration, J. Knot TheoryRamifications 16, 1 (2007) 1–42.

Vasily Dolgushev (Temple University) Graph Complexes 36 / 38

Page 37: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

Selected references on Kontsevich’s formality and itsgeneralizations

[1] V.A. Dolgushev, A Formality quasi-isomorphism for Hochschildcochains over rationals can be constructed recursively,Replacement of arXiv:1306.6733, to appear.

[2] V.A. Dolgushev, Stable formality quasi-isomorphisms forHochschild cochains, arXiv:1109.6031.

[3] M. Kontsevich, Formality conjecture, Deformation theory andsymplectic geometry (Ascona, 1996), 139–156, Math. Phys.Stud., 20, Kluwer Acad. Publ., Dordrecht, 1997.

[4] M. Kontsevich, Deformation quantization of Poisson manifolds,Lett. Math. Phys., 66 (2003) 157–216.

[5] T. Willwacher, Deformation quantization and the Gerstenhaberstructure on the homology of knot spaces, arXiv:1506.07078.

Vasily Dolgushev (Temple University) Graph Complexes 37 / 38

Page 38: The Intricate Maze of Graph Complexes - …vald/GCtalk.pdfThe Intricate Maze of Graph Complexes ... odd permutation in Sk alters the sign factor in front of a graph: ... Due to results

THANK YOU!

Vasily Dolgushev (Temple University) Graph Complexes 38 / 38