Related papers: Explicit Coleman Integration in Larger Characteris…

This paper introduces a new Monte Carlo algorithm to invert large matrices. It is based on simultaneous coupled draws from two random vectors whose covariance is the required inverse. It can be considered a generalization of a previously…

We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…

Years ago S. Weinberg suggested the "Quasi-Particle" method (Q-P) for iteratively solving an integral equation, based on an expansion in terms of sturmian functions that are eigenfunctions of the integral kernel. An improvement of this…

Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computing explicit rational representations of $(\ell,...,\ell)$-isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an…

We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure math- ematics and string theory. We then…

In this work, we systematically analyse Feynman integrals in the `t Hooft-Veltman scheme. We write an explicit reduction resulting from partial fractioning the high-multiplicity integrands to a finite basis of topologies at any given loop…

Kohn introduced in 1979 the algorithm of multipliers to study the subelliptc estimate of the $\bar\partial$-Neumann problem for a smooth weakly pseudoconvex domain in a complex Euclidean space which satisfies D'Angelo's finite type…

We present a geometric multilevel optimization approach that smoothly incorporates box constraints. Given a box constrained optimization problem, we consider a hierarchy of models with varying discretization levels. Finer models are…

We present a novel algorithm based on the ensemble Kalman filter to solve inverse problems involving multiscale elliptic partial differential equations. Our method is based on numerical homogenization and finite element discretization and…

This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…

We consider the distribution of polygonal paths joining the partial sums of normalized Kloosterman sums modulo an increasingly high power p^n of a fixed odd prime p, a pure depth-aspect analogue of theorems of Kowalski-Sawin and…

Let $C$ be a genus $2$ curve with Jacobian isomorphic to the square of an elliptic curve with complex multiplication by a maximal order in an imaginary quadratic field of discriminant $-d<0$. We show that if the stable model of $C$ has bad…

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…

Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…

We study properties of coefficients of a linear form, originating from a multiple integral. As a corollary, we prove Vasilyev's conjecture, connected with the problem of irrationality of the Riemann zeta function at odd integers.

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…

Some explicit algorithms for higher order symplectic integration of a large class of Hamilton's equations have recently been discussed by Mushtaq \emph{et. al}. Here we present a Python program for automatic numerical implementation of…

This is a short review of the construction of quasi-periodic (algebraic-geometrical) solutions to hierarchies of nonlinear integrable equations. As is well known, the solutions are expressed through Riemann's theta-functions associated with…