Related papers: On Bourgain's bound for short exponential sums and…
We prove upper bounds for the error term of the distribution of squarefree numbers up to $X$ in arithmetic progressions modulo $q$ making progress towards two well-known conjectures concerning this distribution and improving upon earlier…
We give asymptotics for correlation sums linked with the distribution of squarefree numbers in arithmetic progressions over a fixed modulus. As a particular case we improve a result of Blomer concerning the variance.
We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.
We obtain new bounds on complete rational exponential sums with sparse polynomials modulo a prime, under some mild conditions on the degrees of the monomials of such polynomials. These bounds, when they apply, give explicit versions of a…
We investigate the error term of the asymptotic formula for the number of squarefree integers up to some bound, and lying in some arithmetic progression a (mod q). In particular, we prove an upper bound for its variance as a varies over…
We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear…
We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.
We estimate short exponential sums weighted by the Fourier coefficients of a Maass form. This requires working out a certain transformation formula for non-linear exponential sums, which is of independent interest. We also discuss how the…
In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results.
This is an expository account of the proof of the theorem of Bourgain, Glibichuk and Konyagin which provides non-trivial bounds for exponential sums over very small multiplicative subgroups of prime finite fields.
We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.
We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.
We obtain function field analogues of recent energy bounds on modular square roots and modular inversions and apply them to bounding some bilinear sums and to some questions regarding smooth and square-free polynomials in residue classes.
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 calculate the mean and variance of sums of the M\"obius function and the indicator function of the squarefrees, in both short intervals and arithmetic progressions, in the context of the ring of polynomials over a finite field of $q$…
We prove an asymptotic formula for squarefree in arithmetic progressions with squarefree moduli, improving previous results by Prachar. The main tool is an estimate for counting solutions of a congruence inside a box that goes beyond what…
We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…
We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…
We show that there is significant cancellation in certain exponential sums over small multiplicative subgroups of finite fields, giving an exposition of the arguments by Bourgain and Chang.
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…