scholarly journals The Barban-Vehov Theorem in Arithmetic Progressions

2019 ◽  
Author(s):  
V Kumar Murty

International audience A result of Barban-Vehov (and independently Motohashi) gives an estimate for the mean square of a sequence related to Selberg's sieve. This upper bound was refined to an asymptotic formula by S. Graham in 1978. In 1992, I made the observation that Graham's method can be used to obtain an asymptotic formula when the sum is restricted to an arithmetic progression. This formula immediately gives a version of the Brun-Titchmarsh theorem. I am taking the occasion of a volume in honour of my friend S. Srinivasan to revisit and publish this observation in the hope that it might still be of interest.

2018 ◽  
Vol 155 (1) ◽  
pp. 126-163 ◽  
Author(s):  
Andrew Granville ◽  
Adam J. Harper ◽  
K. Soundararajan

Halász’s theorem gives an upper bound for the mean value of a multiplicative function$f$. The bound is sharp for general such$f$, and, in particular, it implies that a multiplicative function with$|f(n)|\leqslant 1$has either mean value$0$, or is ‘close to’$n^{it}$for some fixed$t$. The proofs in the current literature have certain features that are difficult to motivate and which are not particularly flexible. In this article we supply a different, more flexible, proof, which indicates how one might obtain asymptotics, and can be modified to treat short intervals and arithmetic progressions. We use these results to obtain new, arguably simpler, proofs that there are always primes in short intervals (Hoheisel’s theorem), and that there are always primes near to the start of an arithmetic progression (Linnik’s theorem).


1999 ◽  
Vol 127 (1) ◽  
pp. 117-131 ◽  
Author(s):  
ALEKSANDAR IVIĆ ◽  
KOHJI MATSUMOTO ◽  
YOSHIO TANIGAWA

We study Δ(x; ϕ), the error term in the asymptotic formula for [sum ]n[les ]xcn, where the cns are generated by the Rankin–Selberg series. Our main tools are Voronoï-type formulae. First we reduce the evaluation of Δ(x; ϕ) to that of Δ1(x; ϕ), the error term of the weighted sum [sum ]n[les ]x(x−n)cn. Then we prove an upper bound and a sharp mean square formula for Δ1(x; ϕ), by applying the Voronoï formula of Meurman's type. We also prove that an improvement of the error term in the mean square formula would imply an improvement of the upper bound of Δ(x; ϕ). Some other related topics are also discussed.


2003 ◽  
Vol Volume 26 ◽  
Author(s):  
A Sankaranarayanan

International audience We prove the upper bound for the mean-square of the absolute value of the Hecke $L$-functions (attached to a holomorphic cusp form) defined for the congruence subgroup $\Gamma_0 (N)$ on the critical line uniformly with respect to its conductor $N$.


2000 ◽  
Vol 43 (2) ◽  
pp. 309-323 ◽  
Author(s):  
Manfred Kühleitner ◽  
Werner Georg Nowak

AbstractIn this article we consider sums S(t) = Σnψ (tf(n/t)), where ψ denotes, essentially, the fractional part minus ½ f is a C4-function with f″ non-vanishing, and summation is extended over an interval of order t. For the mean-square of S(t), an asymptotic formula is established. If f is algebraic this can be sharpened by the indication of an error term.


2013 ◽  
Vol 09 (04) ◽  
pp. 813-843 ◽  
Author(s):  
GREG MARTIN ◽  
NATHAN NG

Let L(s, χ) be a fixed Dirichlet L-function. Given a vertical arithmetic progression of T points on the line ℜs = ½, we show that at least cT/ log T of them are not zeros of L(s, χ) (for some positive constant c). This result provides some theoretical evidence towards the conjecture that all nonnegative ordinates of zeros of Dirichlet L-functions are linearly independent over the rationals. We also establish an upper bound (depending upon the progression) for the first member of the arithmetic progression that is not a zero of L(s, χ).


Author(s):  
Marco Cantarini ◽  
Alessandro Gambini ◽  
Alessandro Zaccagnini

Let [Formula: see text] be the von Mangoldt function, let [Formula: see text] be an integer and let [Formula: see text] be the counting function for the Goldbach numbers with summands in arithmetic progression modulo a common integer [Formula: see text]. We prove an asymptotic formula for the weighted average, with Cesàro weight of order [Formula: see text], with [Formula: see text], of this function. Our result is uniform in a suitable range for [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document