Related papers: Differential Reduction Algorithms for the All-Orde…
We discuss algorithms for arithmetic properties of hypergeometric functions. Most notably, we are able to compute the p-adic valuation of a hypergeometric function on any disk of radius smaller than the p-adic radius of convergence. This we…
We report on three improvements in the context of Feynman integral reduction and $\varepsilon$-factorised differential equations: Firstly, we show that with a specific choice of prefactors, we trivialise the $\varepsilon$-dependence of the…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
Integral representations of hypergeometric functions proved to be a very useful tool for studying their properties. The purpose of this paper is twofold. First, we extend the known representations to arbitrary values of the parameters and…
The generalized hypergeometric function $_qF_p$ is a power series in which the ratio of successive terms is a rational function of the summation index. The Gaussian hypergeometric functions $_2F_1$ and $_3F_2$ are most common special cases…
Following the line of \cite{AS} we propose an improved algorithm which allows to calculate a D-dimensional fermion determinant integrating the exponent of D+1 dimensional Hermitean bosonic action. For a finite extra dimension the…
Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to…
With the aid of simple examples we show how to make simple estimates of the sizes of higher-order Feynman graphs. Our methods enable appropriate values of renormalization and factorization scales to be made. They allow the diagnosis of the…
We present two algorithms for computing hypergeometric solutions of second order linear differential operators with rational function coefficients. Our first algorithm searches for solutions of the form \[ \exp(\int r \,…
We determine closed and compact expressions for the epsilon-expansion of certain Gaussian hypergeometric functions expanded around half-integer values by explicitly solving for their recurrence relations. This epsilon-expansion is…
The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined as the minimum over all cuts in the hypergraph of the ratio of the number of the hyperedges cut to the size of the smaller side of the cut.…
Graphical functions are special position space Feynman integrals, which can be used to calculate Feynman periods and one- or two-scale processes at high loop orders. With graphical functions, renormalization constants have been calculated…
We derive useful reduction formulae which express one-loop Feynman integrals with a large number of external momenta in terms of lower-point integrals carrying easily derivable kinematic coefficients which are symmetric in the external…
We present a new method for the momentum expansion of Feynman integrals with arbitrary masses and any number of loops and external momenta. By using the parametric representation we derive a generating function for the coefficients of the…
Using gradient descent (GD) with fixed or decaying step-size is a standard practice in unconstrained optimization problems. However, when the loss function is only locally convex, such a step-size schedule artificially slows GD down as it…
We consider the derivatives of Horn hypergeometric functions of any number variables with respect to their parameters. The derivative of the function in $n$ variables is expressed as a Horn hypergeometric series of $n+1$ infinite summations…
We present an algorithm of the reduction of the differential equations for master integrals the Fuchsian form with the right-hand side matrix linearly depending on dimensional regularization parameter $\epsilon$. We consider linear…
We present a general formalism that allows for the computation of large-order renormalized expansions in the spacetime representation, effectively doubling the numerically attainable perturbation order of renormalized Feynman diagrams. We…