Search arXivSearch

arXiv · 2110.15546

Matching coefficients in the series expansions of certain $q$-products and their reciprocals

Abstract

We show that the series expansions of certain $q$-products have \textit{matching coefficients} with their reciprocals. Several of the results are associated to Ramanujan's continued fractions. For example, let $R(q)$ denote the Rogers-Ramanujan continued fraction having the well-known $q$-product repesentation $$R(q)=\dfrac{(q;q^5)_\infty(q^4;q^5)_\infty}{(q^2;q^5)_\infty(q^3;q^5)_\infty}.$$ If \begin{align*} \sum_{n=0}^{\infty}α(n)q^n=\dfrac{1}{R^5\left(q\right)}=\left(\sum_{n=0}^{\infty}α^{\prime}(n)q^n\right)^{-1},\\ \sum_{n=0}^{\infty}β(n)q^n=\dfrac{R(q)}{R\left(q^{16}\right)}=\left(\sum_{n=0}^{\infty}β^{\prime}(n)q^n\right)^{-1}, \end{align*} then \begin{align*} α(5n+r)&=-α^{\prime}(5n+r-2) \quad r\in\{3,4\},\\ β(10n+r)&=-β^{\prime}(10n+r-6) \quad r\in\{7,9\}. \end{align*}

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nayandeep Deka Baruah, Hirakjyoti Das. 2021-10-29. Matching coefficients in the series expansions of certain $q$-products and their reciprocals. https://doi.org/10.1007/s11139-021-00534-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