Related papers: A review of Dan's reduction method for multiple po…
In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\epsilon$-accurate solution with probability at…
The integrability problem of rational first-order ODEs $y^{\prime}=\frac{M(x,y)}{N(x,y)}$, where $M,N \in \mathbb{R}[x,y]$ is a long-term research focus in the area of dynamical systems, physics, etc. Although the computer algebra system…
We present a formalism for the calculation of multi-particle one-loop amplitudes, valid for an arbitrary number N of external legs, and for massive as well as massless particles. A new method for the tensor reduction is suggested which…
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…
For partial differential equations (PDEs) that have $n\geq2$ independent variables and a symmetry algebra of dimension at least $n-1$, an explicit algorithmic method is presented for finding all symmetry-invariant conservation laws that…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
Let $N$ be a positive integer. In this paper we shall study the special values of multiple polylogarithms at $N$th roots of unity, called multiple polylogarithm values (MPVs) of level $N$. These objects are generalizations of multiple zeta…
This paper studies three types of functions arising separately in the analysis of algorithms that we analyze exactly using similar Mellin transform techniques. The first is the solution to a Multidimensional Divide-and-Conquer (MDC)…
In recent years, a very exciting and promising method for proving lower bounds for arithmetic circuits has been proposed. This method combines the method of {\it depth reduction} developed in the works of Agrawal-Vinay [AV08], Koiran…
We explore integrals of products of Legendre polynomials with a logarithmic weight function. More precisely, for Legendre polynomials $P_m$ and $P_n$ of orders $m$ and $n$, respectively, we provide simple derivations of the integrals $$\int…
In this article we present logarithmic methods for solving first order and second order ordinary differential equations. The essence of the method is that we apply the basic properties derivatives and logarithms to reduce the number of…
We define linearly reducible elliptic Feynman integrals, and we show that they can be algorithmically solved up to arbitrary order of the dimensional regulator in terms of a 1-dimensional integral over a polylogarithmic integrand, which we…
We introduce an iterated integral version of (generalized) log-sine integrals (iterated log-sine integrals) and prove a relation between a multiple polylogarithm and iterated log-sine integrals. We also give a new method for obtaining…
The aim of this paper is to study the weak convergence analysis of sequence of iterates generated by a three-operator splitting method of Davis and Yin incorporated with two-step inertial extrapolation for solving monotone inclusion problem…
We develop ladders that reduce $\zeta(n):=\sum_{k>0}k^{-n}$, for $n=3,5,7,9,11$, and $\beta(n):=\sum_{k\ge0}(-1)^k(2k+1)^{-n}$, for $n=2,4,6$, to convergent polylogarithms and products of powers of $\pi$ and $\log2$. Rapid computability…
Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known general purpose algorithm is based on the generalized…
We study the power of negation in the Boolean and algebraic settings and show the following results. * We construct a family of polynomials $P_n$ in $n$ variables, all of whose monomials have positive coefficients, such that $P_n$ can be…
We present a new Fortran library to evaluate all harmonic polylogarithms up to weight four numerically for any complex argument. The algorithm is based on a reduction of harmonic polylogarithms up to weight four to a minimal set of basis…
The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been…
In this paper, we present a low-diameter decomposition algorithm in the LOCAL model of distributed computing that succeeds with probability $1 - 1/poly(n)$. Specifically, we show how to compute an $\left(\epsilon, O\left(\frac{\log…