Related papers: The large sieve with power moduli for $\mathbb{Z}[…
We describe a generalization of the large sieve to situations where the underlying groups are nonabelian, and give several applications to the arithmetic of abelian varieties. In our applications, we sieve the set of primes via the system…
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…
We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^\theta$ for $\theta=1/2+1/2000.$ This improves the work of Matom\"aki (2009) who obtained the result for $\theta=1/2-\varepsilon$ (with…
Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…
The large sieve is used to estimate the density of integral quadratic polynomials $Q$, such that there exists an odd degree integral polynomial which has resultant $\pm 1$ with $Q$. Given a monic integral polynomial $R$ of odd degree, this…
We obtain a close to the best possible version of the large sieve inequality with amplitudes given by the values of a polynomial with integer coefficients of degree $\geq 2$.
Improvements of the Large Sieve for Special Sequences
We prove a version of the Bombieri--Vinogradov Theorem with certain products of Gaussian primes as moduli, making use of their special form as polynomial expressions in several variables. Adapting Vaughan's proof of the classical…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
We use Poisson summation formula to calculate integrals of producs of sinc functions (cf. [4]) and related integrals as in [5] and [3]. We also generalize the one in [5] and introduce other remarkable integrals. Finally we give a sum…
We extend bounds on additive energies of modular square roots by Dunn, Kerr, Shparlinski, Shkredov and Zaharescu and apply these results to obtain bounds on certain bilinear exponential sums with modular square roots. From here, we make…
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…
In this paper, we extend the twisted spectral large sieve inequalities of Deshouillers, Iwaniec, Luo, and Young from $\mathrm{SL}_2 (\mathbb{Z})$ onto $\mathrm{PGL}_2 (\mathbb{Z}[i])$.
In this paper we present a new approach to proving some exponential inequalities involving the sinc function. Power series expansions are used to generate new polynomial inequalities that are sufficient to prove the given exponential…
Some difficulties regarding the application of the well-known sieve method are considered in the case when a practical (program) realization of selecting elements, having a particular property among the elements of a set with a sufficiently…
We prove an improved spectral large sieve inequality for the family of $SL_3(\mathbb{Z})$ Hecke-Maass cusp forms. The method of proof uses duality and its structure reveals unexpected connections to Heath-Brown's large sieve for cubic…
A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.
We use the Burgess bound and Selberg sieve to obtain an upper bound on the second moment of sums over an interval $[u+1,u+h]$ of Legendre symbols modulo primes $p$ in a dyadic interval $[Q,2Q]$. The bound is nontrivial and gives a power…