Related papers: An exact solution method for the enumeration of co…
Using contour deformations and integrations over modular forms, we compute certain Bessel moments arising from diagrammatic expansions in two-dimensional quantum field theory. We evaluate these Feynman integrals as either explicit constants…
We study a class of universal Feynman integrals which appear in four-dimensional holomorphic theories. We recast the integrals as the Fourier transform of a certain polytope in the space of loop momenta (aka the ``Operatope''). We derive a…
For correlators in $\mathcal{N}=4$ Super Yang-Mills preserving half the supersymmetry, we manifestly recast the gauge theory Feynman diagram expansion as a sum over dual closed strings. Each individual Feynman diagram maps on to a Riemann…
The universal method of expansion of integrals is suggested. It allows in particular to derive the threshold expansion of Feynman integrals.
A new kind of cut diagram is introduced to sum Feynman diagrams with nonabelian vertices. Unlike the Cutkosky diagrams which compute the discontinuity of single Feynman diagrams, the nonabelian cut diagrams represent a resummation of both…
The near threshold expansion of Feynman diagrams is derived from their configuration space representation, by performing all x integrations. The general scalar Feynman diagram is considered, with an arbitrary number of external momenta, an…
The free energy of a multi-component scalar field theory is considered as a functional W[G,J] of the free correlation function G and an external current J. It obeys non-linear functional differential equations which are turned into…
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…
We introduce a novel, systematic method for the complete symbolic reduction of multi-loop Feynman integrals, leveraging the power of generating functions. The differential equations governing these generating functions naturally yield…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm…
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching…
In rigidly supersymmetric quantum theories, the Nicolai map allows one to turn on a coupling constant (from zero to a finite value) by keeping the (free) functional integration measure but subjecting the fields to a particular nonlocal and…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…
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…