Related papers: The sliding-sum method for short exponential sums
We describe mean value estimates for exponential sums of degree exceeding 2 that approach those conjectured to be best possible. The vehicle for this recent progress is the efficient congruencing method, which iteratively exploits the…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…
Improving and extending recent results of the author, we conditionally estimate exponential sums with Dirichlet coefficients of L-functions, both over all integers and over all primes in an interval. In particular, we establish new…
We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
Sum of Squares programming has been used extensively over the past decade for the stability analysis of nonlinear systems but several questions remain unanswered. In this paper, we show that exponential stability of a polynomial vector…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
We present a new method in problems where estimates are needed for finite population domains with small or even zero sample sizes. In contrast to known estimation methods, an auxiliary information is used to model sizes of population units…
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…
We propose a framework for computing, optimizing and integrating with respect to a smooth marginal likelihood in statistical models that involve high-dimensional parameters/latent variables and continuous low-dimensional hyperparameters.…
First we generalize a famous lemma of Gallagher on the mean square estimate for exponential sums by plugging a weight in the right hand side of Gallagher's original inequality. Then we apply it in the special case of the Cesaro weight, in…
We provide a new hybrid estimation of single exponential sums, combining Van der Corput, Huxley and Bourgain's result. We also focus on primes in short intervals $(x-x^{\alpha},x]$ under the assumption of the existence of exceptional…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…
In this paper we propose a (non-linear) smoothing algorithm for group-affine observation systems, a recently introduced class of estimation problems on Lie groups that bear a particular structure. As most non-linear smoothing methods, the…
In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…
We derive in this short report the exponential as well as power decreasing tail estimations for the sums of centered exchangeable random variables, alike ones for the sums of the centered independent ones.