Search arXivSearch

arXiv · 1705.07193

Finite Ramanujan expansions and shifted convolution sums of arithmetical functions, II

Abstract

We continue our study of convolution sums of two arithmetical functions $f$ and $g$, of the form $\sum_{n \le N} f(n) g(n+h)$, in the context of heuristic asymptotic formulæ. Here, the integer $h\ge 0$ is called, as usual, the {\it shift} of the convolution sum. We deepen the study of finite Ramanujan expansions of general $f,g$ for the purpose of studying their convolution sum. Also, we introduce another kind of Ramanujan expansion for the convolution sum of $f$ and $g$, namely in terms of its shift $h$ and we compare this \lq \lq shifted Ramanujan expansion\rq \rq, with our previous finite expansions in terms of the $f$ and $g$ arguments. Last but not least, we give examples of such shift expansions, in classical literature, for the heuristic formulæ.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giovanni Coppola, M. Ram Murty. 2017-05-19. Finite Ramanujan expansions and shifted convolution sums of arithmetical functions, II. https://doi.org/10.1016/j.jnt.2017.09.022

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

KEEP EXPLORING

Related papers

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

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