English
Related papers

Related papers: Primes in arithmetic progressions to large moduli …

200 papers

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

Number Theory · Mathematics 2015-11-09 Jan Büthe

We correct the proof of the theorem in the previous paper presented by the first named author, which concerns Sturm bounds for Siegel modular forms of degree $2$ and of even weights modulo a prime number dividing $2\cdot 3$. We give also…

Number Theory · Mathematics 2015-08-10 Toshiyuki Kikuta , Sho Takemori

We obtain an analog of the Montgomery-Hooley asymptotic formula for the variance of the number of primes in arithmetic progressions. In the present paper the moduli are restricted to the sequences of integer parts $[F(n)]$, where $F(t) =…

Number Theory · Mathematics 2017-06-23 Roger Baker , Tristan Freiberg

Several new estimates for the 2-adic valuations of Stirling numbers of the second kind are proved. These estimates, together with criteria for when they are sharp, lead to improvements in several known theorems and their proofs, as well as…

Number Theory · Mathematics 2019-12-04 Arnold Adelberg

We revisit the large sieve for square moduli and obtain conditional improvements under hypotheses on higher additive energies of modular square roots.

Number Theory · Mathematics 2026-01-07 Stephan Baier

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

Number Theory · Mathematics 2024-09-10 Jon Grantham , Andrew Granville

We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the…

Symbolic Computation · Computer Science 2010-11-24 Xavier Dahan , Abdulilah Kadri , Éric Schost

The purpose of this paper is twofold: 1) Applications of Gallagher's larger sieve modulo prime squares do not work. In some relevant cases we can transform the residue class information modulo $p^2$ to more suitable residue information…

Number Theory · Mathematics 2026-03-19 Rainer Dietmann , Christian Elsholtz , Imre Ruzsa

In this paper we first establish new explicit estimates for Chebyshev's $\vartheta$-function. Applying these new estimates, we derive new upper and lower bounds for some functions defined over the prime numbers, for instance the prime…

Number Theory · Mathematics 2017-05-18 Christian Axler

By involving some exponential sums related to $\Lambda(n)$ in arithmetic progression, we can obtain some new results for von Mangoldt function over {\bf nonhomogeneous} Beatty sequences in arithmetic progressions, which improve some recent…

Number Theory · Mathematics 2025-02-11 Wei Zhang

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…

Number Theory · Mathematics 2019-11-25 M. A. Korolev

We establish large sieve inequalities for power moduli in imaginary quadratic number fields, extending earlier work of Baier and Bansal for the Gaussian field.

Number Theory · Mathematics 2021-12-09 Peng Gao , Liangyi Zhao

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

The paper focuses on the behaviour of unimodular Fourier multipliers with exponential growth in the context of weighted $L^p$-spaces. Our main result shows that much of the general theory of multipliers is approachable through the theory of…

Functional Analysis · Mathematics 2026-05-12 María Jesús Carro , Alberto Salguero-Alarcón

We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset…

Number Theory · Mathematics 2015-09-17 Xuancheng Shao

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Number Theory · Mathematics 2022-02-08 Anne-Maria Ernvall-Hytönen , Neea Palojärvi

We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. The Kac-Kubilius model suggests that the distribution of values of a given additive function can…

Number Theory · Mathematics 2011-09-02 Maksym Radziwill

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…

Number Theory · Mathematics 2024-11-26 Thomas Wright

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

Number Theory · Mathematics 2016-11-23 Adrian Dudek

We give a new bound for the large sieve inequality with power moduli q^k that is uniform in k. The proof uses a new theorem due to T. Wooley from his work on efficient congruencing.

Number Theory · Mathematics 2012-02-28 Karin Halupczok