Related papers: The divisor function along arithmetic progressions…

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…

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 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 investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

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.

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.

Iannucci considered the positive divisors of a natural number $n$ that do not exceed the square root of $n$ and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be…

We prove an asymptotic formula for a variant of the binary additive divisor problem with linear factors in the arguments, which has a power saving error term and which is uniform in all involved parameters.

Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…

We show that the exponent of distribution of the ternary divisor function $d_3$ in arithmetic progressions to prime moduli is at least 1/2+1/46, improving results of Heath-Brown and Friedlander--Iwaniec. Furthermore, when averaging over a…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…

We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+\delta}$ which have conveniently sized divisors. The main feature of…

We show that smooth-supported multiplicative functions $f$ are well-distributed in arithmetic progressions $a_1a_2^{-1} \pmod q$ on average over moduli $q\leq x^{3/5-\varepsilon}$ with $(q,a_1a_2)=1$.

In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…

Let $\mathbb{F}_q[t]$ be the polynomial ring over the finite field $\mathbb{F}_{q}$. For arithmetic functions $\psi_{1}, \psi_{2}: \mathbb{F}_{q}[t]\rightarrow\mathbb{C}$, we establish that if a Bombieri-Vinogradov type equidistribution…

A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…

We exploit the properties of a sequence of functions that approximate the divisor functions and combine them with an analytical formula of a delta-like sequence to give a new proof of a theorem of Gronwall on the asymptotic of the divisor…

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…

In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…