English
Related papers

Related papers: On the large sieve with sparse sets of moduli

200 papers

We continue our investigations of bilinear sums with modular square roots and the large sieve for square moduli in our recent article "On bilinear sums with modular square roots and applications II", arXiv:2603.00768. In the present…

Number Theory · Mathematics 2026-04-07 Stephan Baier

In this paper, we establish a general version of the large sieve with additive characters for restricted sets of moduli in arbitrary dimension for function fields. From this, we derive function field versions for the large sieve in high…

Number Theory · Mathematics 2019-10-16 Stephan Baier , Rajneesh Kumar Singh

We improve on the best available bounds for the square-free sieve and provide a general framework for its applicability. The failure of the local-to-global principle allows us to obtain results better than those reached by a classical…

Number Theory · Mathematics 2015-06-26 Harald Helfgott

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

In this paper we study the distribution of squares modulo a square-free number $q$. We also look at inverse questions for the large sieve in the distribution aspect and we make improvements on existing results on the distribution of…

Number Theory · Mathematics 2015-02-19 Farzad Aryan

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.

Number Theory · Mathematics 2018-12-27 Patrick Letendre

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…

Number Theory · Mathematics 2026-01-29 Stephan Baier

In this paper, we develop a large sieve type inequality for some special characters whose moduli are squares of primes. Our result gives non-trivial estimate in certain ranges.

Number Theory · Mathematics 2007-05-23 Liangyi Zhao

In this note we give a new bound for large sieve with characters to power moduli which improves in some range of the parameters the previous bounds of Baier/Zhao and Halupczok.

Number Theory · Mathematics 2019-10-22 Marc Munsch

An exponent of distribution 1/16 is established for square-free palindromes. The main input is an upper bound for the number of palindromes, in arithmetic progressions to large moduli, divisible by large squares. Our argument combines a…

Number Theory · Mathematics 2026-03-31 Aleksandr Tuxanidy

We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.

Number Theory · Mathematics 2016-08-24 Fei Wei , Boqing Xue , Yitang Zhang

Let $K$ be a global field and let $Z$ be a geometrically irreducible algebraic variety defined over $K$. We show that if a big set $S\subseteq Z$ of rational points of bounded height occupies few residue classes modulo $\mathfrak{p}$ for…

Number Theory · Mathematics 2021-11-16 Juan Manuel Menconi , Marcelo Paredes , Román Sasyk

In this paper we obtain a sharp upper bound for the number of solutions to a certain diophantine inequality involving fractions with power denominator. This problem is motivated by a conjecture of Zhao concerning the spacing of such…

Number Theory · Mathematics 2019-04-22 Bryce Kerr

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

Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…

Number Theory · Mathematics 2008-11-13 Florent Jouve

We give improved lower bounds for the number of solutions of some $S$-unit equations over the integers, by counting the solutions of some associated linear equations as the coefficients in those equations vary over sparse sets. This method…

Number Theory · Mathematics 2011-08-19 Adam J. Harper

In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…

Number Theory · Mathematics 2020-11-11 Ankush Goswami , Venkata Raghu Tej Pantangi

We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-\epsilon}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and…

Number Theory · Mathematics 2020-06-15 James Maynard

The Li--Wan sieve is extended to multisets when the underlying set is symmetric. The main ingredient of the proof is the Mobius inversion formula on the poset of partitions of $\{1,2,\dots,k\}$ ordered by refinement. As illustrative…

Combinatorics · Mathematics 2021-10-11 Jiyou Li , Xiang Yu

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…

Number Theory · Mathematics 2025-06-13 Tim Browning , Stephanie Chan