No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
The full text of this article is not currently available.
The signed permutation group on Feynman graphs
D. B. West, Introduction to Graph Theory, 2nd ed. (Prentice Hall, 2000).
C. Kassel, “Quantum groups,” in Graduate Texts in Mathematics (Springer, New York, 1995), Vol. 155.
, “Hopf algebras, from basics to applications to renormalization
,” in 5th Mathematical Meeting of Glanon: Algebra, Geometry and Applications to Physics Glanon, Burgundy, France, 2–6 July 2001, https://inspirehep.net/record/580001
; e-print arXiv:math/0408405
ϕk-theories are scalar field theories treating only one kind of particles with spin zero represented by the one-component scalar field ϕ. Those particles self-interact in groups of k which means that all vertices are k-valent.
A more detailed description of the notion of the forest can be found in Ref. 1
It should be pointed out that there are two different definitions of the notion of a forest. In the present case we define the forest (of subdivergences) in the context of renormalization and Hopf algebra. This definition is also in accordance with the forest formula introduced in Section III. Within the framework of graph polynomials (cf., Subsection II B) the forest (or k-forest) is defined as a graph without cycles/loops consisting of k connected components. That is, a k-forest is given by the disjoint union of k trees. For example, the forest set in Figure 6 follows this definition.
Note that, by abuse of notation, 𝕀 denotes the unit map as well as the empty tree.
For reminding the notation, see Definition 1.
L. Rotheray, “Hopf subalgebras from Green’s functions,” Master’s thesis, Humboldt-Universität zu Berlin, Berlin, Germany, 2014.
E. Panzer, “Feynman integrals and hyperlogarithms,” Ph.D. thesis, Humboldt-Universität zu Berlin, Berlin, Germany, 2014.
Here and throughout this article we explicitly exclude lightlike particles.
In -theory, the superficial degree of divergence is given by ωD = 2 ⋅ EΓ − D ⋅ L since the weight of the edges and vertices is ω(e) = 2 and ω(v) = 0, respectively.
M. Sars, “Parametric representation of Feynman amplitudes in gauge theories,” Ph.D. thesis,Humboldt-Universität zu Berlin, Berlin, Germany, 2015.
Note that for the empty forest , the graph polynomials are defined as ψ0̸ = 1 and ϕ0̸(Θ) = 0.
L. Comtet, Advanced Combinatorics (Springer, Netherlands, 1974).
D. Stanton and D. White, “Constructive combinatorics,” in Undergraduate Texts in Mathematics (Springer, New York, 1986).
Article metrics loading...
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalization group are small, we can expand the integral and only consider the lowest orders in the scaling. The aim of this article is to determine specific combinations of graphs in a scalar quantum field theory that lead to a remarkable simplification of the first non-trivial term in the perturbation series. It will be seen that the result is independent of the renormalization scheme and the scattering angles. To achieve that goal we will utilize the parametric representation of scalar Feynman integrals as well as the Hopf algebraic structure of the Feynman graphs under consideration. Moreover, we will present a formula which reduces the effort of determining the first-order term in the perturbation series for the specific combination of graphs to a minimum.
Full text loading...
Most read this month