Related papers: The geometric bookkeeping guide to Feynman integra…
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
We develop all of the components needed to construct an adaptive finite element code that can be used to approximate fractional partial differential equations, on non-trivial domains in $d\geq 1$ dimensions. Our main approach consists of…
Single scale Feynman integrals in quantum field theories obey difference or differential equations with respect to their discrete parameter $N$ or continuous parameter $x$. The analysis of these equations reveals to which order they…
We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an…
We introduce the tools of intersection theory to the study of Feynman integrals, which allows for a new way of projecting integrals onto a basis. In order to illustrate this technique, we consider the Baikov representation of maximal cuts…
This paper exploits a basic connection between sequential quadratic programming and Riemannian gradient optimization to address the general question of selecting a metric in Riemannian optimization, in particular when the Riemannian…
We investigate how sorting algorithms efficiently overcome the exponential size of the permutation space. Our main contribution is a new continuous-time formulation of sorting as a gradient flow on the permutohedron, yielding an independent…
We present two algorithms for computing what we call the absolute factorization of a difference operator. We also give an algorithm to solve third order difference equations in terms of second order equations, together with applications to…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
We compute the $n_h$ terms to the massive three loop vector-, axialvector-, scalar- and pseudoscalar form factors in a direct analytic calculation using the method of large moments. This method has the advantage, that the master integrals…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
Over the last two decades, several fast, robust, and high-order accurate methods have been developed for solving the Poisson equation in complicated geometry using potential theory. In this approach, rather than discretizing the partial…
We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
The elementary theory of bivariate linear Diophantine equations over polynomial rings is used to construct causal lifting factorizations (elementary matrix decompositions) for causal two-channel FIR perfect reconstruction transfer matrices…
We calculate 3-loop master integrals for heavy quark correlators and the 3-loop QCD corrections to the $\rho$-parameter. They obey non-factorizing differential equations of second order with more than three singularities, which cannot be…
We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…
In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on…
For the fractional Laplacian of variable order, an efficient and accurate numerical evaluation in multi-dimension is a challenge for the nature of a singular integral. We propose a simple and easy-to-implement finite difference scheme for…
We introduce an efficient combination of polyhedral analysis and predicate partitioning. Template polyhedral analysis abstracts numerical variables inside a program by one polyhedron per control location, with a priori fixed directions for…