English
Related papers

Related papers: Primes in arithmetic progressions to large moduli …

200 papers

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

Recently, Bruinier and Ono classified cusp forms $f(z) := \sum_{n=0}^{\infty} a_f(n)q ^n \in S_{\lambda+1/2}(\Gamma_0(N),\chi)\cap \mathbb{Z}[[q]]$ that does not satisfy a certain distribution property for modulo odd primes $p$. In this…

Number Theory · Mathematics 2007-05-23 Dohoon Choi

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

We obtain the analog of the Bombieri-Vinogradov theorem for square moduli up to any power of x less than 1/2.

Number Theory · Mathematics 2016-02-11 Roger Baker

Let $K=\mathbb{Q}(\omega)$ with $\omega$ the root of a degree $n$ monic irreducible polynomial $f\in\mathbb{Z}[X]$. We show the degree $n$ polynomial $N(\sum_{i=1}^{n-k}x_i\omega^{i-1})$ in $n-k$ variables formed by setting the final $k$…

Number Theory · Mathematics 2019-10-30 James Maynard

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…

Number Theory · Mathematics 2025-09-05 Lasse Grimmelt , Jori Merikoski

Consider the Fourier expansions of two elements of a given space of modular forms. How many leading coefficients must agree in order to guarantee that the two expansions are the same? Sturm gave an upper bound for modular forms of a given…

Number Theory · Mathematics 2013-04-09 Sam Chow , Alexandru Ghitza

We adopt A. J. Irving's sieve method to study the almost-prime values produced by products of irreducible polynomials evaluated at prime arguments. This generalizes the previous results of Irving and Kao, who separately examined the…

Number Theory · Mathematics 2019-11-05 C. S. Franze , P. H. Kao

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Number Theory · Mathematics 2018-02-21 Xianchang Meng

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher…

Combinatorics · Mathematics 2018-06-20 G. Shakan , I. D. Shkredov

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

Number Theory · Mathematics 2010-04-08 Janos Pintz

By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power…

Number Theory · Mathematics 2025-10-31 Bernd C. Kellner

We introduce a refinement of the classical Liouville function to primes in arithmetic progressions. Using this, we discover new biases in the appearances of primes in a given arithmetic progression in the prime factorizations of integers.…

Number Theory · Mathematics 2020-07-24 Peter Humphries , Snehal M. Shekatkar , Tian An Wong

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

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…

Number Theory · Mathematics 2018-04-18 Daniele Mastrostefano

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…

Number Theory · Mathematics 2025-09-15 Thomas Wright

We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$…

Number Theory · Mathematics 2024-02-01 Kaisa Matomäki , Jori Merikoski , Joni Teräväinen

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…

Number Theory · Mathematics 2020-11-24 Jitendra Bajpai , Subham Bhakta , Victor C. Garcia

We prove new large sieve inequalities for the Fourier coefficients $\rho_{j\mathfrak{a}}(n)$ of exceptional Maass forms of a given level, weighted by sequences $(a_n)$ with sparse Fourier transforms - including two key types of sequences…

Number Theory · Mathematics 2026-02-25 Alexandru Pascadi

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Number Theory · Mathematics 2026-05-19 Jitender Singh