Search arXivSearch

arXiv · 2405.06678

Modularity of certain products of the Rogers-Ramanujan continued fraction

Abstract

We study the modularity of the functions of the form $r(τ)^ar(2τ)^b$, where $a$ and $b$ are integers with $(a,b)\neq (0,0)$ and $r(τ)$ is the Rogers-Ramanujan continued fraction, which may be considered as companions to the Ramanujan's function $k(τ)=r(τ)r(2τ)^2$. In particular, we show that under some condition on $a$ and $b$, there are finitely many such functions generating the field of all modular functions on the congruence subgroup $Γ_1(10)$. Furthermore, we establish certain arithmetic properties of the function $l(τ)=r(2τ)/r(τ)^2$, which can be used to evaluate these products. We employ the methods of Lee and Park, and some properties of $η$-quotients and generalized $η$-quotients to prove our results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Russelle Guadalupe. 2025-09-16. Modularity of certain products of the Rogers-Ramanujan continued fraction. https://doi.org/10.1007/s11139-025-01221-4

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