On a theorem of Kontsevich

Mathematics – Quantum Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol3/agt-3-42.abs.html

Scientific paper

In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to all cyclic operads, in the process giving a more careful treatment of the construction than in Kontsevich's original papers. We also give a more explicit treatment of the isomorphisms of graph homologies with the homology of moduli space and Out(F_r) outlined by Kontsevich. In [`Infinitesimal operations on chain complexes of graphs', Mathematische Annalen, 327 (2003) 545-573] we defined a Lie bracket and cobracket on the commutative graph complex, which was extended in [James Conant, `Fusion and fission in graph complexes', Pac. J. 209 (2003), 219-230] to the case of all cyclic operads. These operations form a Lie bi-algebra on a natural subcomplex. We show that in the associative and Lie cases the subcomplex on which the bi-algebra structure exists carries all of the homology, and we explain why the subcomplex in the commutative case does not.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On a theorem of Kontsevich does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a theorem of Kontsevich, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a theorem of Kontsevich will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-402356

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.