相关论文: Counting the number of Feynman Graphs in QCD
We present a simple technique that allows to generate Feynman diagrams for vector models with interactions of order $2n$ and similar models (Gross-Neveu, Thirring model), using a bootstrap equation that uses only the free field value of the…
The calculation of the symmetry factor corresponding to a given Feynman diagram is well known to be a tedious problem. We have derived a simple formula for these symmetry factors. Our formula works for any diagram in scalar theory ($\phi^3$…
An algorithm for the automatic Feynman diagram (FD) generation is presented in this paper. The algorithm starts directly from the definition formula of FD, and is simple in concept and easy for coding. The symmetry factor for each FD is…
We discuss the enumeration of Feynman diagrams at tree order for processes with external lines of different types. We show how this can be done by iterating algebraic Schwinger-Dyson equations. Asymptotic estimates for very many external…
We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
This paper presents a new method of numerical computation of the QED contributions to the electron anomalous magnetic moment which arises from Feynman graphs containing electron and photon lines and not containing electron loops. The method…
A generating function is derived that counts the number of diagrams in an arbitrary scalar field theory. The number of graphs containing any number $n_j$ of $j$-point vertices is given. The count is also used to obtain the number of…
Two programs for the computation of perturbative expansions of quantum field theory amplitudes are provided. feyngen can be used to generate Feynman graphs for Yang-Mills, QED and $\varphi^k$ theories. Using dedicated graph theoretic tools…
The amplitude of a Feynman graph in Quantum Field Theory is related to the point-count over finite fields of the corresponding graph hypersurface. This article reports on an experimental study of point counts over F_q modulo q^3, for graphs…
A computer program for evaluating colour factors of QCD Feynman diagrams is presented, and illustrative examples on how to use the program to calculate non trivial colour factors are given. The program and the discussion in this paper is…
A computer program has been developed which generates Feynman graphs automatically for scattering and decay processes in non-Abelian gauge theory of high-energy physics. A new acceleration method is presented for both generating and…
Quantum corrections significantly influence the quantities observed in modern particle physics. The corresponding theoretical computations are usually quite lengthy which makes their automation mandatory. This review reports on the current…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
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…
This article reports an automated approach to the evaluation of higher-order terms of QED perturbation to anomalous magnetic moments of charged leptons by numerical means. We apply this approach to tenth-order correction due to a particular…
We present some techniques which have been developed recently or in the recent past to compute Feynman graphs beyond one-loop order. These techniques are useful to compute the three-loop splitting functions in QCD and to obtain the complete…
We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…
We discuss the computational complexity of the perturbative evaluation of scattering amplitudes, both by the Caravaglios-Moretti algorithm and by direct evaluation of the individual diagrams. For a self-interacting scalar theory, we…
We present an iterative algorithm to count Feynman diagrams via many-body relations. The algorithm allows us to count the number of diagrams of the exact solution for the general fermionic many-body problem at each order in the interaction.…