Search arXivSearch

arXiv · 2502.04712

Some $q$-hypergeometric identities associated with partition theorems of Lebesgue, Schur and Capparelli

Abstract

Here, we establish a polynomial identity in three variables $a, b, c$, and with the degree of the polynomial given in terms of two integers $L, M$. By letting $L$ and $M$ tend to infinity, we get the 1993 Alladi-Gordon $q$-hypergeometric key-identity for the generalized Schur Theorem as well as the fundamental Lebesgue identity by two different choices of the variables. This polynomial identity provides a generalization and a unified approach to the Schur and Lebesgue theorems. We discuss other analytic identities for the Lebesgue and Schur theorems and also provide a key identity ($q$-hypergeometric) for Andrews' deep refinement of the Alladi-Schur theorem. Finally, we discuss a new infinite hierarchy of identities, the first three of which relate to the partition theorems of Euler, Lebesgue, and Capparelli, and provide their polynomial versions as well.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yazan Alamoudi, Krishnaswami Alladi. 2025-10-19. Some $q$-hypergeometric identities associated with partition theorems of Lebesgue, Schur and Capparelli. https://arxiv.org/abs/2502.04712

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