English
Related papers

Related papers: Lower Bounds for Expressions of Large Sieve Type

200 papers

We prove an essentially optimal large sieve inequality for self-dual Eisenstein series of varying levels. This bound can alternatively be interpreted as a large sieve inequality for rationals ordered by height. The method of proof is…

Number Theory · Mathematics 2026-05-06 Matthew P Young

The method of proof of Balog and Ruzsa and the large sieve of Linnik are used to investigate the behaviour of the $L^{1}$ norm of a wide class of exponential sums over the square-free integers and the primes. Further, a new proof of the…

Number Theory · Mathematics 2019-08-20 Emily Eckels , Steven Jin , Andrew Ledoan , Brian Tobin

Drawing inspiration from the work of Nathanson and Yamada we prove that every even integer larger than $\exp (\exp (32.7))$ can be written as the sum of a prime and the product of at most two primes.

Number Theory · Mathematics 2025-06-26 Matteo Bordignon , Daniel R. Johnston , Valeriia Starichkova

We establish a result on the large sieve with square moduli. These bounds impro ve recent results by S. Baier(math.NT/0512228) and L. Zhao(math.NT/0508125).

Number Theory · Mathematics 2007-11-28 Staphen Baier , Liangyi Zhao

By using a variant of Kowalski's large sieve for Frobenius in compatible systems, we obtain zero-density estimates for arguments of $\ell$-adic trace functions over finite fields with values in some algebraic subsets of the cyclotomic…

Number Theory · Mathematics 2019-10-24 Corentin Perret-Gentil

We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function…

Number Theory · Mathematics 2007-05-23 Emmanuel Kowalski

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 prove an averaged version of a claim suspected to be true by Alladi, Erd\"os, and Vaaler. Qualitatively, the result states that a divisor sum of a multiplicative function, which obeys certain size constraints, derives most of its value…

Number Theory · Mathematics 2025-09-17 Cooper O'Kuhn

We give an upper bound for the exponential sum over squarefree integers. This establishes a conjecture by Br\"udern and Perelli.

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

Number Theory · Mathematics 2025-09-19 Pierre-Alexandre Bazin

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

Number Theory · Mathematics 2025-11-25 Chenghui Ren

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…

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

We prove a lower bound for the large sieve with square moduli.

Number Theory · Mathematics 2019-09-11 Stephan Baier , Sean B. Lynch , Liangyi Zhao

We give a short proof of a sumset conjecture of Erd\"os, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. The proof is written in the framework of…

Dynamical Systems · Mathematics 2019-12-03 Bernard Host

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

Combinatorics · Mathematics 2013-02-19 Alain Plagne , Anne de Roton

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum $\sum_p a_p$ over primes $p$, where $(a_n)_{x/2<n\le x}$ is an arbitrary non-negative sequence satisfying Type I and Type II…

Number Theory · Mathematics 2024-07-22 Kevin Ford , James Maynard

We establish a new bound for the exponential sum \begin{eqnarray*} \sum_{x\in\mathcal{X}}\Big|\sum_{y\in \mathcal{Y}}\gamma(y)\exp(2\pi i a \lambda^{xy}/p)\Big|, \end{eqnarray*} where $\lambda$ is an element of the residue ring modulo a…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev , A. A. Karatsuba

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.

Number Theory · Mathematics 2013-07-01 T. D. Browning

We study the two-parameter quadratic sieve for a general test function. We prove, under some very general assumptions, that the function considered by Barban and Vehov [BV68] and Graham [Gra78] for this problem is optimal up to and…

Number Theory · Mathematics 2022-01-06 Emanuel Carneiro , Andrés Chirre , Harald Andrés Helfgott , Julian Mejia-Cordero

We propose a conjecture for exponential sums which generalizes both a conjecture by Igusa and a local variant by Denef and Sperber, in particular, it is without the homogeneity condition on the polynomial in the phase, and with new…

Number Theory · Mathematics 2014-06-04 Raf Cluckers , Willem Veys
‹ Prev 1 2 3 10 Next ›