2016
DOI: 10.1090/proc/12914
|View full text |Cite
|
Sign up to set email alerts
|

On the variance of sums of divisor functions in short intervals

Abstract: Given a positive integer n the k-fold divisor function d k (n) equals the number of ordered k-tuples of positive integers whose product equals n. In this article we study the variance of sums of d k (n) in short intervals and establish asymptotic formulas for the variance of sums of d k (n) in short intervals of certain lengths for k = 3 and for k ≥ 4 under the assumption of the Lindelöf hypothesis.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

4
16
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(21 citation statements)
references
References 13 publications
(16 reference statements)
4
16
0
Order By: Relevance
“…Our main concern is to understand its mean square. For relatively long intervals, Lester [29] proves an asymptotic (assuming RH for k > 3) similar to the result (1.3):…”
Section: Introductionsupporting
confidence: 76%
“…Our main concern is to understand its mean square. For relatively long intervals, Lester [29] proves an asymptotic (assuming RH for k > 3) similar to the result (1.3):…”
Section: Introductionsupporting
confidence: 76%
“…Our proof follows the argument of Lester [18]. Most of the steps are analogous, but we present the details for the sake of completeness.…”
Section: Useful Resultsmentioning
confidence: 89%
“…Jutila's method is not applicable here essentially for two reasons; first one being that trigonometric polynomials in the truncated GL(n)-Voronoi summation formula are more complicated than in the lower rank setting and the other one is that the error term in the relevant truncated Voronoi summation formula gives larger contribution than the expected main term. Instead, we follow Lester [18] who treats a similar problem for the error term of the Dirichlet divisor problem for the k-fold divisor function by combining Jutila's method with the one of Selberg [25]. Selberg's method can also be applied to other problems concerning automorphic forms, see e.g.…”
Section: The Main Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…What is known rigorously over the integers in the short-interval setting of Conjecture 2 follows from using summation formulas related to the functional equation for the Riemann zeta function. In this way Lester [23] has evaluated the variance for c ∈ (k − 1, k). It is likely that a similar argument could be used to verify Conjecture 1 in this restricted range for all k (indeed, this is close to the strategy of [22] in the case k = 2).…”
Section: Introductionmentioning
confidence: 99%