“…In the rational case Timofeev has given a Bombieri-Vinogradov type theorem with a very general convolution, though not one with as long a summation of an unknown function such as h. Theorem 4 both generalises and extends a result due to Wu [31], though we cannot base our arguments, as he does, on [24].…”
Section: Weight Functionsmentioning
confidence: 85%
“…His work [29] not only has stronger results and applies to more general functions than earlier papers but it also has aspects that enable the present generalisation. For instance, it makes no use of either the Pólya-Vinogradov Theorem or approximate functional equation for appropriate L-functions, both seen in [24]. The complication of detail of the proof in the present paper over [29] comes from the need (see Section 10) to introduce smooth functions.…”
Section: λ(α)mentioning
confidence: 96%
“…Results for rational primes in short intervals have been given by Jutila [18], Huxley & Iwaniec [16], Ricci [27], Perelli, Pintz and Salerno [24,25], Zhan [32], and Timofeev [29].…”
“…In the rational case Timofeev has given a Bombieri-Vinogradov type theorem with a very general convolution, though not one with as long a summation of an unknown function such as h. Theorem 4 both generalises and extends a result due to Wu [31], though we cannot base our arguments, as he does, on [24].…”
Section: Weight Functionsmentioning
confidence: 85%
“…His work [29] not only has stronger results and applies to more general functions than earlier papers but it also has aspects that enable the present generalisation. For instance, it makes no use of either the Pólya-Vinogradov Theorem or approximate functional equation for appropriate L-functions, both seen in [24]. The complication of detail of the proof in the present paper over [29] comes from the need (see Section 10) to introduce smooth functions.…”
Section: λ(α)mentioning
confidence: 96%
“…Results for rational primes in short intervals have been given by Jutila [18], Huxley & Iwaniec [16], Ricci [27], Perelli, Pintz and Salerno [24,25], Zhan [32], and Timofeev [29].…”
“…We note that of course there is no particular significance in N -N ~/2, the only fact we really need is log N = O(log(N -M))). Actually it is an essentially relaxed version of those results that allow us to take Q = N ~ (with ~ = 1/40 and 7 = 1/30 in [2] and [8] respectively) and also allow us to take an arbitrarily large negative power of logarithm in the right-hand side of the bound.…”
Section: Theorem For Any Fixed N > 2 and An Arbitrary Function O(x)~mentioning
Abstract. It is shown that, for an arbitrary function O(x) -+ o% for almost all prime numbers p of any interval of the form [N -N v/12 +~, N] there exists an irreducible modulo p polynomial with coefficients of order O(O(p)).
“…The method of proof of both works [24] and [30] uses Heath-Brown's identity, therefore the analogue of (1.28) can be proved mutatis mutandis for E 2 -numbers as well. Accordingly, we will prove Theorem 4.…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.