Related papers: Generalized divisor functions in arithmetic progre…

We prove that for a large class of multiplicative functions, referred to as generalized divisor functions, it is possible to find a lower bound for the corresponding variance in arithmetic progressions. As a main corollary, we deduce such a…

We investigate the first and second moments of shifted convolutions of the generalised divisor function $d_3(n)$.

We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

We study the shifted convolution sum of the divisor function and some other arithmetic functions.

We prove a uniform generalized gaussian bound for the powers of a discrete convolution operator in one space dimension. Our bound is derived under the assumption that the Fourier transform of the coefficients of the convolution operator is…

We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…

We prove an asymptotic formula for the smoothed shifted convolution of the generalised divisor function $d_k(n)$ and the divisor function $d(n)$, with a power-saving error term independent of $k$. In particular, when $k$ is large, this is…

Nguyen has shown that on averaging over $a=1,...,q$ the 3-fold divisor function has exponent of distribution 2/3, following \cite {banks}. We follow [2] which leads to stronger bounds.

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_k(n)$ and $d(n)$ with $k \geq 4$, which is uniform in the shift parameter and which has a power-saving error term, improving results obtained previously…

In this article, we study the higher-power moments of restricted divisor functions. In order to establish our main results, we prove a more general result pertaining to the distribution of solutions to certain multiplicative Diophantine…

We establish sharp lower bounds for shifted (with two shifts) moments of Dirichlet $L$-function of fixed modulus under the generalized Riemann hypothesis.

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_3(n)$ and $d(n)$, which is uniform in the shift parameter and which has a power-saving error term. The method is also applied to give analogous estimates…

We obtain a strong bound on the second moment of the $GL_3$ standard $L$-function on the critical line. The method builds on the recent work of Aggarwal, Leung, and Munshi which treated shorter intervals. We deduce some corollaries…

In this paper, we prove a Voronoi summation formula for the shifted 3-fold divisor function twisted by additive characters. As the main tool, we provide the functional equation for the shifted $GL(3)$ Estermann function.

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

We refine the conditions for the lower bound in an abstract large deviation result with nonconvex rate function we had previously introduced. We apply the results to certain stochastic recursive schemes.

We extend a lower bound of Munshi on sums over divisors of a number $n$ which are less than a fixed power of $n$ from the squarefree case to the general case. In the process we prove a lower bound on the entropy of a geometric distribution…

We bound from below the number of shifted primes p+s<x that have a divisor in a given interval (y,z]. Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the…