Search arXivSearch

arXiv · 1908.07737

Some results on vanishing coefficients in infinite product expansions

Abstract

Recently, M. D. Hirschhorn proved that, if $\sum_{n=0}^\infty a_nq^n := (-q,-q^4;q^5)_\infty(q,q^9;q^{10})_\infty^3$ and $\sum_{n=0}^\infty b_nq^n:=(-q^2,-q^3;q^5)_\infty(q^3,q^7;q^{10})_\infty^3$, then $a_{5n+2}=a_{5n+4}=0$ and $b_{5n+1}=b_{5n+4}=0$. Motivated by the work of Hirschhorn, D. Tang proved some comparable results including the following: If $ \sum_{n=0}^\infty c_nq^n := (-q,-q^4;q^5)_\infty^3(q^3,q^7;q^{10})_\infty$ and $\sum_{n=0}^\infty d_nq^n := (-q^2,-q^3;q^5)_\infty^3(q,q^9;q^{10})_\infty$, then $c_{5n+3}=c_{5n+4}=0$ and $d_{5n+3}=d_{5n+4}=0$. In this paper, we prove that $a_{5n}=b_{5n+2}$, $a_{5n+1}=b_{5n+3}$, $a_{5n+2}=b_{5n+4}$, $a_{5n-1}=b_{5n+1}$, $c_{5n+3}=d_{5n+3}$, $c_{5n+4}=d_{5n+4}$, $c_{5n}=d_{5n}$, $c_{5n+2}=d_{5n+2}$, and $c_{5n+1}>d_{5n+1}$. We also record some other comparable results not listed by Tang.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nayandeep Deka Baruah, Mandeep Kaur. 2019-08-21. Some results on vanishing coefficients in infinite product expansions. https://doi.org/10.1007/s11139-019-00172-x

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