Related papers: The sliding-sum method for short exponential sums
In this paper, we establish a new estimate (including lower and upper bounds) for an important quantity involved in the convergence analysis of smoothed aggregation algebraic multigrid methods. The new upper bound improves the existing…
Methods of determining, from small-variable asymptotic expansions, the characteristic exponents for variables tending to infinity are analyzed. The following methods are considered: diff-log Pad\'e summation, self-similar factor…
We investigate the application of the Adaptive Multilevel Splitting algorithm for the estimation of tail probabilities of solutions of Stochastic Differential Equations evaluated at a given time, and of associated temporal averages. We…
We consider an arbitrary-Lagrangian-Eulerian evolving surface finite element method for the numerical approximation of advection and diffusion of a conserved scalar quantity on a moving surface. We describe the method, prove optimal order…
We consider the distribution of the polygonal paths joining partial sums of classical Kloosterman sums, as their parameter varies modulo a prime tending to infinity. Using independence of Kloosterman sheaves, we prove convergence in the…
The paper considers a universal approach that allows one to quite simply obtain nonlinear asymptotic estimates of various summation functions. It is shown the application of this approach to the asymptotic estimation of divergent Dirichlet…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
We study averages over squarefree moduli of the size of exponential sums with polynomial phases. We prove upper bounds on various moments of such sums, and obtain evidence of un-correlation of exponential sums associated to different…
We show that smooth numbers are equidistributed in arithmetic progressions to moduli of size $x^{66/107-o(1)}$. This overcomes a longstanding barrier of $x^{3/5-o(1)}$ present in previous works of Bombieri-Friedlander-Iwaniec,…
Let $\Lambda(n)$ be the von Mangoldt function, $x$ real and $2\leq y \leq x$. This paper improves the estimate on the exponential sum over primes in short intervals \[ S_k(x,y;\alpha) = \sum_{x< n \leq x+y} \Lambda(n) e\left( n^k \alpha…
In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…
In this note, we presented a new decomposition of elements of finite fields of even order and illustrated that it is an effective tool in evaluation of some specific exponential sums over finite fields, the explicit value of some…
We propose a method for finding a cumulative distribution function (cdf) that minimizes the distance to a given cdf, while belonging to an ambiguity set constructed relative to another cdf and, possibly, incorporating soft information. Our…
We establish an exponential error term for the renewal theorem in the context of products of random matrices, which is surprising compared with classical abelian cases. A key tool is the Fourier decay of the Furstenberg measures on the…
In this paper, we obtain some formulae for harmonic sums, alternating harmonic sums and Stirling number sums by using the method of integral representations of series. As applications of these formulae, we give explicit formula of several…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
We obtain a complete description of anisotropic scaling limits and the existence of scaling transition for nonlinear functions (Appell polynomials) of stationary linear random fields on $\mathbb{Z}^2$ with moving average coefficients…
This paper discusses how to find the global minimum of functions that are summations of small polynomials (``small'' means involving a small number of variables). Some sparse sum of squares (SOS) techniques are proposed. We compare their…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…
We develop constrained Bayesian estimation methods for small area problems: those requiring smoothness with respect to similarity across areas, such as geographic proximity or clustering by covariates; and benchmarking constraints,…