Related papers: Method of Brackets and Feynman diagrams evaluation
We present an algorithm to evaluate multiloop Feynman integrals with an arbitrary number of internal massive lines, with the masses being in general complex-valued, and its implementation in the \textsc{Mathematica} package…
Feynman diagram expressions in ordinary field theories can be written in a string-like manner. The methods and the advantages for doing so are briefly discussed.
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
We develop techniques for computing and analyzing multiple unitarity cuts of Feynman integrals, and reconstructing the integral from these cuts. We study the relations among unitarity cuts of a Feynman integral computed via diagrammatic…
Some problems related to the structure of higher terms of the epsilon-expansion of Feynman diagrams are discussed.
We develop a general framework for quantum field theory on noncommutative spaces, i.e., spaces with quantum group symmetry. We use the path integral approach to obtain expressions for $n$-point functions. Perturbation theory leads us to…
In this paper we describe a new method of calculation of master integrals based on the solution of systems of difference equations in one variable. An explicit example is given, and the generalization to arbitrary diagrams is described. As…
This article gives an overview of recent results on the relation between quantum field theory and motives, with an emphasis on two different approaches: a "bottom-up" approach based on the algebraic geometry of varieties associated to…
I discuss algorithms for the evaluation of Feynman integrals. These algorithms are based on Hopf algebras and evaluate the Feynman integral to (multiple) polylogarithms.
Ramanujan derived the well known divergent-sum of integers in more than one way. We generalise the informal method to higher powers of the Riemann zeta function through a study of the Eulerian numbers in particular. Within the context of…
The parametric representation has been used since a long time for the evaluation of Feynman diagrams. As a dimension independent intermediate representation, it allows a clear description of singularities. Recently, it has become a choice…
The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…
The reduction of Feynman integrals to master integrals is an algebraic problem that requires algorithmic approaches at the modern level of calculations. Straightforward applications of the classical Buchberger algorithm to construct…
The perturbative expansion of tensorial field theories in Feynman graphs can be interpreted as weighted generating series of some piecewise linear varieties. This simple fact establishes a link between two a priori distinct fields: the…
The purpose of this expository paper is to highlight the starring role of time-frequency analysis techniques in some recent contributions concerning the mathematical theory of Feynman path integrals. We hope to draw the interest of…
Two recently developed techniques of analytic evaluation of multifold Mellin-Barnes (MB) integrals are presented. Both approaches rest on the definition of geometrical objets conveniently associated with the MB integrands, which can then be…
We continue our investigation into the insertion-elimination Lie algebra of Feynman graphs in the ladder case, emphasizing the structure of this Lie algebra relevant for future applications in the study of Dyson-Schwinger equations. We work…
We consider multi-edge or banana graphs $b_n$ on $n$ internal edges $e_i$ with different masses $m_i$. We focus on the cut banana graphs $\Im(\Phi_R(b_n))$ from which the full result $\Phi_R(b_n)$ can be derived through dispersion. We give…
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.…
We discuss the use of methods coming from integrable systems to study problems of enumerative and algebraic combinatorics, and develop two examples: the enumeration of Alternating Sign Matrices and related combinatorial objects, and the…