Generating loop graphs via Hopf algebra in quantum field theory
From MaRDI portal
Abstract: We use the Hopf algebra structure of the time-ordered algebra of field operators to generate all connected weighted Feynman graphs in a recursive and efficient manner. The algebraic representation of the graphs is such that they can be evaluated directly as contributions to the connected n-point functions. The recursion proceeds by loop order and vertex number.
Recommendations
- Hopf algebras and the combinatorics of connected graphs in quantum field theory
- Feynman graph generation and calculations in the Hopf algebra of Feynman graphs
- Combinatorics of n-point functions via Hopf algebra in quantum field theory
- The Hopf algebra approach to Feynman diagram calculations
- scientific article; zbMATH DE number 2221919
Cites work
Cited in
(9)- A novel approach to perturbative calculations for a large class of interacting boson theories
- An algebraic representation of graphs and applications to graph enumeration
- Hopf algebras and the combinatorics of connected graphs in quantum field theory
- A combinatorial matrix approach for the generation of vacuum Feynman graphs multiplicities in ^4 theory
- Combinatorics of n-point functions via Hopf algebra in quantum field theory
- Graph rules for the linked cluster expansion of the Legendre effective action
- Inductive approach to loop vertex expansion
- Combinatorics of 1-particle irreducible n-point functions via coalgebra in quantum field theory
- Feynman graph generation and calculations in the Hopf algebra of Feynman graphs
This page was built for publication: Generating loop graphs via Hopf algebra in quantum field theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3442121)
