Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.13082

A triple convolution sum of the divisor function

Bikram Misra·M. Ram Murty·Biswajyoti Saha
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the triple convolution sum of the divisor function given by $$\sum_{n\leq x} d(n)d(n-h)d(n+h)$$ for $h\neq 0$ and $d(n)$ denotes the number of positive divisors of $n$. Based on algebraic and geometric considerations, Browning conjectured that the above sum is asymptotic to $c_hx(\log x)^3$, for a suitable constant $c_h\neq 0$, as $x\to \infty$. This conjecture is still unproved. Using sieve-theoretic results of Wolke and Nair (respectively), it is possible to derive the exact order of the sum. The lower bound of the correct order of magnitude can also be derived by very elementary arguments. In this paper, using the Tauberian theory for multiple Dirichlet series, we prove an explicit lower bound and provide a new theoretical framework to predict Browning's conjectured constant $c_h$.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bikram Misra, M. Ram Murty, Biswajyoti Saha. 2025-09-01. A triple convolution sum of the divisor function. https://arxiv.org/abs/2508.13082

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗