Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0701528

Arithmetical properties of Multiple Ramanujan sums

Yoshinori Yamasaki
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the present paper, we introduce a multiple Ramanujan sum for arithmetic functions, which gives a multivariable extension of the generalized Ramanujan sum studied by D. R. Anderson and T. M. Apostol. We then find fundamental arithmetic properties of the multiple Ramanujan sum and study several types of Dirichlet series involving the multiple Ramanujan sum. As an application, we evaluate higher-dimensional determinants of higher-dimensional matrices, the entries of which are given by values of the multiple Ramanujan sum.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yoshinori Yamasaki. 2007-01-19. Arithmetical properties of Multiple Ramanujan sums. https://doi.org/10.1007/s11139-010-9223-8

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↗