Cohomology of Feynman graphs and perturbative quantum field theory

Mathematics – Quantum Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Dec. 2003, LaTeX, 15 pages; appeared in Focus on Quantum Field Theory, Nova Publishers Inc. 2005

Scientific paper

An analog of Kreimer's coproduct from renormalization of Feynman integrals in quantum field theory, endows an analog of Kontsevich's graph complex with a dg-coalgebra structure. The graph complex is generated by orientation classes of labeled directed graphs. A graded commutative product is also defined, compatible with the coproduct. Moreover, a dg-Hopf algebra is identified. Graph cohomology is defined applying the cobar construction to the dg-coalgebra structure. As an application, L-infinity morphisms represented as series over Feynman graphs correspond to graph cocycles. Notably the total differential of the cobar construction corresponds to the L-infinity morphism condition. The main example considered is Kontsevich's formality morphism. The relation with perturbative quantum field theory is considered by interpreting L-infinity morphisms as partition functions, and the coefficients of the graph expansions as Feynman integrals.

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

Cohomology of Feynman graphs and perturbative quantum field theory 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 Cohomology of Feynman graphs and perturbative quantum field theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cohomology of Feynman graphs and perturbative quantum field theory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-538720

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