2006
DOI: 10.1007/s10474-006-0092-y
|View full text |Cite
|
Sign up to set email alerts
|

Short interval asymptotics for a class of arithmetic functions

Abstract: We provide a general asymptotic formula which permits applications to sums like x

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(13 citation statements)
references
References 11 publications
0
13
0
Order By: Relevance
“…Using the method similar to that in this paper, we can prove the following proposition. Combining the method of this paper with that of [2], we can prove the following proposition. Let r(n) be the number of representations of n as the sum of two squares.…”
Section: Some Remarksmentioning
confidence: 84%
See 1 more Smart Citation
“…Using the method similar to that in this paper, we can prove the following proposition. Combining the method of this paper with that of [2], we can prove the following proposition. Let r(n) be the number of representations of n as the sum of two squares.…”
Section: Some Remarksmentioning
confidence: 84%
“…If the result of Iwaniec [4] could be generalized to ζ K (s), then the error terms in (6.2) and (6.3) could be improved to O(x 1 2 (log x) 3 ). Furthermore, the sums studied in [2] x<n≤x+y r 2 (n), x<n≤x+y r(n 3 ), x<n≤x+y d(n)r(n) could also be improved correspondingly.…”
Section: Some Remarksmentioning
confidence: 99%
“…For the details of the arguments the reader is referred to the authors' original articles [1], [2], and [6].…”
Section: Under These Assumptions It Follows Thatmentioning
confidence: 99%
“…However, it is amazing how many interesting applications (cf. also [2] and [6] for a few more) are contained in the special case considered.…”
Section: Concluding Remarkmentioning
confidence: 99%
“…In this example, F (n) is either τ (n) 2 , or τ (n 3 ). Improving on a result from[5], Zhai[13, Corollary 4] showed thatx<n x+y F (n) ∼ C F y(log x) 3 for y = o(x) with y x 1/2 log x → ∞ lorsque x → ∞ and where C F = 1 6ζ(2)…”
mentioning
confidence: 99%