Related papers: On the Feynman Graph Integrals on Elliptic Curves
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
We classify holomorphic Cartan geometries on every compact complex curve, and on every compact complex surface which contains a rational curve.
We study Feynman integrals in the representation with Schwinger parameters and derive recursive integral formulas for massless 3- and 4-point functions. Properties of analytic (including dimensional) regularization are summarized and we…
We describe constructions of infinite graphs which are not representable as integral graphs in the plane, addressing a question of Erd\H{o}s. We also mention some related problems.
We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is…
Cosmological correlators encode statistical properties of the initial conditions of our universe. Mathematically, they can often be written as Mellin integrals of a certain rational function associated to graphs, namely the flat space…
The Neumann problem on an ellipsoid in R^n asks for a function harmonic inside the ellipsoid whose normal derivative is some specified function on the ellipsoid. We solve this problem when the specified function on the ellipsoid is a…
We propose a variant of elliptic multiple polylogarithms that have at most logarithmic singularities in all variables and satisfy a differential equation without homogeneous term. We investigate several non-trivial elliptic two-loop Feynman…
This note gives explicit equations for the elliptic curves (in characteristic not 2 or 3) with mod 2 representation isomorphic to that of a given one.
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
A conditional bound is given for the average analytic rank of elliptic curves over an arbitrary number field. In particular, under the assumptions that all elliptic curves over a number field $K$ are modular and have $L$-functions which…
Feynman integrals appropriately generalized are $\mathsf A$-hypergeometric functions. Among the properties of $\mathsf A$-hypergeometric functions are symmetries associated with the Newton polytope. In ordinary hypergeometric functions…
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…
We present an algorithm for determining the minimal order differential equations associated to a given Feynman integral in dimensional or analytic regularisation. The algorithm is an extension of the Griffiths-Dwork pole reduction adapted…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…
Symmetric elliptic integrals, which have been used as replacements for Legendre's integrals in recent integral tables and computer codes, are homogeneous functions of three or four variables. When some of the variables are much larger than…
This paper introduces certain elliptic Harnack inequalities for harmonic functions in the setting of the product space $M \times X$, where $M$ is a (weighted) Riemannian Manifold and $X$ is a countable graph. Since some standard arguments…
A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…