A triple convolution sum of the divisor function

Abstract

We study the triple convolution sum of the divisor function given by Σn≤ x d(n)d(n-h)d(n+h) for h≠ 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 chx( x)3, for a suitable constant ch≠ 0, as x ∞. 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 ch.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…