Related papers: Sums over Graphs and Integration over Discrete Gro…
We show a direct matching between individual Feynman diagrams and integration measures in the scattering equation formalism of Cachazo, He and Yuan. The connection is most easily explained in terms of triangular graphs associated with…
We introduce a simple procedure to integrate differential forms with arbitrary holomorphic poles on Riemann surfaces. It gives rise to an intrinsic regularization of such singular integrals in terms of the underlying conformal geometry.…
We propose a framework for calculating two-loop Feynman diagrams which appear within a renormalizable theory in the general mass case and at finite external momenta. Our approach is a combination of analytical results and of high accuracy…
A method of Feynman diagrams summation, based on using Schwinger-Dyson equations and Ward identities, is verified by calculating some four-loop diagrams in N=1 supersymmetric electrodynamics, regularized by higher derivatives. In…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…
I describe a mathematical framework for the efficient processing of the very large sets of Feynman diagrams contributing to the scattering of many particles. I reexpress the established numerical methods for the recursive construction of…
We present a method for computing the framing on the cohomology of graph hypersurfaces defined by the Feynman differential form. This answers a question of Bloch, Esnault and Kreimer in the affirmative for an infinite class of graphs for…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…
The diagrammatic coaction underpins the analytic structure of Feynman integrals, their cuts and the differential equations they admit. The coaction maps any diagram into a tensor product of its pinches and cuts. These correspond…
Planar arrays of tree diagrams were introduced as a generalization of Feynman diagrams that enables the computation biadjoint amplitudes $m^{(k)}_n$ for $k>2$ . In this follow-up work we investigate the poles of $m^{(k)}_n$ from the…
Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…
We review the combinatorial structure of perturbative quantum field theory with emphasis given to the decomposition of graphs into primitive ones. The consequences in terms of unique factorization of Dyson--Schwinger equations into Euler…
Inspired by some new advances on normal factor graphs (NFGs), we introduce NFGs as a simple and intuitive diagrammatic approach towards encoding some concepts from linear algebra. We illustrate with examples the workings of such an approach…
A Feynman formula is a representation of a solution of an initial (or initial-boundary) value problem for an evolution equation (or, equivalently, a representation of the semigroup resolving the problem) by a limit of $n$-fold iterated…
We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…
General results on asymptotic expansions of Feynman diagrams in momenta and/or masses are reviewed. It is shown how they are applied for calculation of massive diagrams.
Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…