English
Related papers

Related papers: On the exponential large sieve inequality for spar…

200 papers

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

Number Theory · Mathematics 2012-03-02 Jean Bourgain , Moubariz Garaev , Sergei Konyagin , Igor Shparlinski

We establish a large sieve inequality for power moduli in $\mathbb{Z}[i]$, extending earlier work by L. Zhao and the first-named author on the large sieve for power moduli for the classical case of moduli in $\mathbb{Z}$. Our method starts…

Number Theory · Mathematics 2018-05-25 Stephan Baier , Arpit Bansal

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…

Number Theory · Mathematics 2012-10-25 Jean Bourgain , Moubariz Z. Garaev , Sergei V. Konyagin , Igor E. Shparlinski

We slightly improve Garaev's recent sum-product estimate largely by using Plunneke's inequality a little more efficiently. We improve the exponent from 15/14 to 14/13.

Number Theory · Mathematics 2007-05-23 Nets Hawk Katz , Chun-Yen Shen

We improve the large sieve inequality with $k$th-power moduli, for all $k\ge 4$. Our method relates these inequalities to a restricted variant of Waring's problem. Firstly, we input a classical divisor bound on the number of representations…

Number Theory · Mathematics 2024-10-24 Stephan Baier , Sean B. Lynch

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$.

Number Theory · Mathematics 2007-07-05 Gyan Prakash , D. S. Ramana

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…

Number Theory · Mathematics 2026-04-28 Igor Shparlinski , Yixiu Xiao

The author sharpens a result of Jia (1996), showing that the interval $[n, n+n^{\frac{1}{21.5}+\varepsilon}]$ contains prime numbers for almost all $n$. Watt's mean value bound, a delicate sieve decomposition and more accurate estimates for…

Number Theory · Mathematics 2025-09-26 Runbo Li

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…

Number Theory · Mathematics 2016-07-26 Karin Halupczok

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…

Number Theory · Mathematics 2022-10-21 Buxin Su

Computation of the large sparse matrix exponential has been an important topic in many fields, such as network and finite-element analysis. The existing scaling and squaring algorithm (SSA) is not suitable for the computation of the large…

Numerical Analysis · Mathematics 2021-10-12 Feng Wu , Kailing Zhang , Li Zhu , Jiayao Hu

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

Number Theory · Mathematics 2025-01-10 Olivier Ramaré

Let $p$ be a large prime number. We prove that any integer $\lambda$ modulo $p$ can be represented in the form $$ m!n! +\sum_{i=1}^{47}n_i!\equiv \lambda \pmod p, $$ with $\max\{m,n,n_1,\ldots,n_{47}\}\ll p^{1300/1301}.$ This improves the…

Number Theory · Mathematics 2025-09-01 Moubariz Z. Garaev , Julio C. Pardo

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

In this paper, we develop a large sieve type inequality with quadratic amplitude. We use the double large sieve to establish non-trivial bounds.

Number Theory · Mathematics 2007-06-13 Liangyi Zhao

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

Number Theory · Mathematics 2022-05-02 Rainer Dietmann , Christian Elsholtz

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

Number Theory · Mathematics 2025-08-13 William Banks , Kevin Ford , Terence Tao

Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…

Number Theory · Mathematics 2013-11-26 Ben J. Green , Adam J. Harper

We obtain new results about the representation of almost all residues modulo a prime $p$ by a product of a small integer and also an element of small multiplicative subgroup of $({\mathbb Z}/p{\mathbb Z})^*$. These results are based on some…

Number Theory · Mathematics 2014-12-09 Marc Munsch , Igor Shparlinski

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

Number Theory · Mathematics 2009-10-03 Oriol Serra , Gilles Zémor