Related papers: A review of Dan's reduction method for multiple po…

A compression algorithm is introduced for multi-determinant wave functions which can greatly reduce the number of determinants that need to be evaluated in quantum Monte Carlo calculations. We have devised an algorithm with three levels of…

We give a simple explicit construction of the Grassmannian n-logarithm, which is a multivalued analytic function on the quotient of the Grassmannian of generic n-dimensional subspaces in 2n-dimensional coordinate complex vector space by the…

In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…

Multiple Deligne values (MDVs) are iterated integrals on the interval $x\in[0,1]$ of the differential forms $A=d\log(x)$, $B=-d\log(1-x)$ and $D=-d\log(1-\lambda x)$, where $\lambda$ is a primitive sixth root of unity. MDVs of weight 11…

We present a new algorithm for the reduction of one-loop \emph{tensor} Feynman integrals with $n\leq 4$ external legs to \emph{scalar} Feynman integrals $I_n^D$ with $n=3,4$ legs in $D$ dimensions, where $D=d+2l$ with integer $l \geq 0$ and…

Let $\mathfrak{g}$ be a semisimple Lie algebra over $\mathbb{C}$ having rank $l$ and let $V=L(\lambda)$ be an irreducible finite-dimensional $\mathfrak{g}$-module having highest weight $\lambda.$ Computations of weight multiplicities in…

In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…

Classical multiple zeta values can be viewed as iterated integrals of the differentials $\frac{dt}{t}, \frac{dt}{1-t}$ from $0$ to $1$. In this paper, we reprove Brown's theorem: For $a_i, b_i, c_{ij}\in \mathbb{Z}$, the iterated integral…

We consider one-loop scalar and tensor integrals with an arbitrary number of external legs relevant for multi-parton processes in massless theories. We present a procedure to reduce N-point scalar functions with generic 4-dimensional…

In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…

We give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$…

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an…

I give an efficient algorithm for the reduction of multi-leg one-loop integrals of rank one. The method combines the basic ideas of the spinor algebra approach with the dual vector approach and is applicable to box integrals or higher point…

The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to…

In this paper, we construct a uniform formula that can iteratively reduce all auxiliary scalar product numerators of arbitrary multi-loop Feynman integrals. Integrals with such numerators commonly appear in Integration-By-Parts (IBP)…

Herein, we present a polylogarithmic decomposition method to load the matrix from the linearized 1-dimensional Burgers' equation onto a quantum computer. First, we use the Carleman linearization method to map the nonlinear Burgers' equation…

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…

Generalizing a classical one-variable theorem of Harald Bohr, we show that if an n-variable power series has modulus less than 1 in the unit polydisc, then the sum of the moduli of the terms is less than 1 in the polydisc of radius…

We study the formula complexity of Iterated Sub-Permutation Matrix Multiplication, the logspace-complete problem of computing the product of $k$ $n$-by-$n$ Boolean matrices with at most a single $1$ in each row and column. For all $d \le…