Related papers: On a certain additive divisor problem

We prove an asymptotic formula with power saving error term for a certain triple divisor sum.

We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box $[-X,X]^4$ that satisfy the determinant equation $x_1x_2-x_3x_4=r$ for $r \neq 0$ with two of entries to be…

Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…

This paper reports on a new algorithm to compute the asymptotic solutions of a linear differential system. A feature of the algorithm is the ability to accommodate periodic coefficients.

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_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 establish asymptotic formulae for various correlations involving general divisor functions $d_k(n)$ and partial divisor functions $d_l(n,A)=\sum_{q|n:q\leq n^A}d_{l-1}(q)$, where $A\in[0,1]$ is a parameter and $k,l\in\mathbb{N}$ are…

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

We remove logarithmic factors in error term estimates in asymptotic formulas for the number of solutions of a class of additive congruences modulo a prime number.

A pair of linearly independent asymptotic solutions are constructed for the second-order linear difference equation {equation*} P_{n+1}(x)-(A_{n}x+B_{n})P_{n}(x)+P_{n-1}(x)=0, {equation*} where $A_n$ and $B_n$ have asymptotic expansions of…

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…

An asymptotic formula is proved for the k-fold divisor function averaged over homogeneous polynomials of degree k in k-1 variables coming from incomplete norm forms.

Suppose $a$ and $b$ are two fixed positive integers such that $(a,b)=1.$ In this paper we shall establish an asymptotic formula for the mean square of the error term $\Delta_{a,b}(x)$ of the general two-dimensional divisor problem.

We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.

We consider a binary quadratic variant of the Titchmarsh divisor problem and give an asymptotic formula for $\sum_{p^2+q^2\leq N} \tau(p^2+q^2+1)$, where $p,q$ are primes.

In this note we show that the methods of Motohashi and Meurman yield the same upper bound on the error term in the binary additive divisor problem. With this goal, we improve an estimate in the proof of Motohashi.

In this paper we consider the existence of positive solutions for a singular elliptic problem involving an asymtotically linear nonlinearity and depending on one positive parameter. Using variational methods, together with comparison…

We establish power saving asymptotics for the sum of the divisor function along a binary quartic form, improving on work of Daniel. The proof involves an application of a recent two dimensional delta method due to Li, Rydin-Myerson, and…

We prove an asymptotic formula for the number of multi-quadratic number fields of bounded discriminant with a power-saving error term. Furthermore, we explicitly calculate the leading coefficient and extend our result to totally real…

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in…