Search arXivSearch

arXiv · 2411.11890

Some asymptotic formulae involving Cohen-Ramanujan expansions

Abstract

Cohen-Ramanujan sum, denoted by $c_r^s(n)$, is an exponential sum similar to the Ramanujan sum $c_r(n):=\sum\limits_{\substack{h=1\\{(h,r)=1}}}^{r}e^{\frac{2πi n h}{r}}$. An arithmetical function $f$ is said to admit a Cohen-Ramanujan expansion $ f(n):=\sum\limits_{r}\widehat{f}(r)c_r^s(n)$ if the series on the right hand side converges for suitable complex numbers $\widehat{f}(r)$. Given two arithmetical functions $f$ and $g$ with absolutely convergent Cohen-Ramanujan expansions, we derive an asymptotic formula for the sum $\sum\limits_{\substack{n\leq N}}f(n)g(n+h)$ where $h$ is a fixed non negative integer. We also provide Cohen-Ramanujan expansions for certain functions to illustrate some of the results we prove consequently.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arya Chandran, Vishnu Namboothiri K. 2024-11-07. Some asymptotic formulae involving Cohen-Ramanujan expansions. https://arxiv.org/abs/2411.11890

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