A finite analogue of a \(q\)-series identity of Bhoria, Eyyunni and Maji and its applications (Q2099470)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A finite analogue of a \(q\)-series identity of Bhoria, Eyyunni and Maji and its applications |
scientific article |
Statements
A finite analogue of a \(q\)-series identity of Bhoria, Eyyunni and Maji and its applications (English)
0 references
23 November 2022
0 references
Recently, \textit{A. Dixit} and \textit{B. Maji} [Ramanujan J. 52, No. 2, 323--358 (2020; Zbl 1445.11114)] obtained a generalization of a result of \textit{S. Ramanujan} [Notebooks of Srinivasa Ramanujan. Vols. 1, 2. Bombay: Tata Institute of Fundamental Research (1957; Zbl 0138.24201)], which is recorded in the present paper as Theorem \(1.1\). \textit{A. Dixit} et al. [J. Comb. Theory, Ser. A 180, Article ID 105423, 50 p. (2021; Zbl 1464.11104)] obtained finite analogue of Theorem \(1.1\), same is recorded as Theorem \(1.2\) in the present paper. \textit{S. C. Bhoria} et al. [Ramanujan J. 58, No. 2, 435--462 (2022; Zbl 1489.11158)] further generalized Theorem \(1.1\), and in the present paper same is recorded as Theorem \(1.3\). In present paper, the authors obtain a finite analogue of Theorem \(1.3\), which allows to obtain finite analogues of all five entries of Ramanujan, which are recorded on pages \(354\) and \(355\) of his second notebook; also they derive a result involving sum of a \(_{2}\phi_{1}\) which has several important corollaries, such as generalization of the generating function version of G.E. Andrews's famous identity (i.e., \(spt(n)=np(n)-\frac{1}{2}N_{2}(n)\)) as well as of an identity involving the function \(N_{SC}(n)\) (see section \(5.2\)). Further, they generalize an identity given by \textit{G. E. Andrews} et al. [Acta Arith. 158, No. 3, 199--218 (2013; Zbl 1268.05019)] considering finite analogues of first odd moments of ranks and cranks. The authors also discuss further direction for future research.
0 references
partitions
0 references
finite analogues
0 references
smallest parts function
0 references
rank
0 references
crank
0 references
0 references