Papers
Topics
Authors
Recent
2000 character limit reached

The oriented graph complexes

Published 19 Aug 2013 in math.QA | (1308.4006v2)

Abstract: Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GCor_n is quasi-isomorphic to the ordinary commutative graph complex GC_{n-1}, up to some known classes. This yields in particular a combinatorial description of the action of the Grothendieck-Teichm\"uller Lie algebra on Lie bialgebras, and shows that a cycle-free formality morphism in the sense of Shoikhet can be constructed rationally without reference to configuration space integrals.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.