Related papers: A note on the distribution of $d_3(n)$ in arithmet…

We study the Dyson rank function $N(r,3;n)$, the number of partitions of $n$ with rank $\equiv r \pmod 3$. We investigate the convexity of these functions. We extend $N(r,3;n)$ multiplicatively to the set of partitions, and we determine the…

This paper is devoted to the study of $$ U_t(a,q):=\sum_{1\leq n_1<n_2<\cdots<n_t}\frac{q^{n_1+n_2+\cdots+n_t}}{(1+aq^{n_1}+q^{2n_1})(1+aq^{n_2}+q^{2n_2})\cdots(1+aq^{n_t}+q^{2n_t})} $$ when $a$ is one of $0, \pm 1, \pm2$. The idea builds…

In this paper, we study the sum of the divisor function over sets with digit restrictions.

In this paper, we study the distribution of the sequence of integers $d(n^2)$ under the assumption of the strong Riemann hypothesis. Under this assumption, we provide a refined asymptotic formula for the sum $\displaystyle\sum_{n\leq…

We improve unconditional estimates on $\Delta_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $\Delta_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a…

Part-and-parcel of the study of "multiplicative number theory" is the study of the distribution of multiplicative functions in arithmetic progressions. Although appropriate analogies to the Bombieri-Vingradov Theorem have been proved for…

We give a relatively simple proof that \[ \int _0^1\left |\sum _{n\leq x}d(n)e(n\alpha )\right |d\alpha \asymp \sqrt x.\]

We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical…

This article studies a general divide-and-conquer algorithm for approximating continuous one-dimensional probability distributions with finite mean. The article presents a numerical study that compares pre-existing approximation schemes…

Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound…

We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…

This paper presents results about the distribution of subsequences which are typical in the sense of Baire. The first part is concerned with sequences of the type x_k = n_k*alpha, n_1 < n_2 < n_3 < ..., mod 1. Improving a result of Salat we…

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…

We prove an averaged version of a claim suspected to be true by Alladi, Erd\"os, and Vaaler. Qualitatively, the result states that a divisor sum of a multiplicative function, which obeys certain size constraints, derives most of its value…

We show that, in a restricted range, the divisor function of integers in residue classes modulo a prime follows a Gaussian distribution, and a similar result for Hecke eigenvalues of classical holomorphic cusp forms. Furthermore, we obtain…

We study averages along the integers using the divisor function $d(n)$, and defined as $$K_N f (x) = \frac{1}{D(N)} \sum _{n \leq N} d(n) \,f(x+n) , $$ where $D(N) = \sum _{n=1} ^N d(n) $. We shall show that these averages satisfy a…

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…