Engel expansions and the Rogers-Ramanujan identities (Q1971706): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Asymptotic analysis of Ramanujan pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Generalization of the Rogers-Ramanujan Identities for Odd Moduli / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3861471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computer-Assisted Investigation of Ramanujan Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse polynomial expansions of Laurent series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse polynomial expansions of Laurent series. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Identities of the Rogers-Ramanujan Type / rank
 
Normal rank

Latest revision as of 13:58, 29 May 2024

scientific article
Language Label Description Also known as
English
Engel expansions and the Rogers-Ramanujan identities
scientific article

    Statements

    Engel expansions and the Rogers-Ramanujan identities (English)
    0 references
    0 references
    0 references
    0 references
    7 June 2000
    0 references
    The authors introduce a generalization of the notion of Engel series and use it to give new proofs of identities first proven by Euler, Jacobi and Rogers and Ramanujan. The Engel series is an algorithm for representing real numbers and is of the form \(t=\sum^\infty_{n=1} {1\over a_1a_2\cdots a_n}\), where \(a_1,a_2, \dots\) is a non-decreasing sequence of natural numbers with \(a_1\geq 2\). The generalization of this algorithm is to the formal Laurent series over the field of complex numbers \(\mathbb{C}\). If \(A= \sum^\infty_{n= \nu}c_nq^n\), \(\nu=\nu(A)\) is called the order of \(A\) and \(\|A\|= 2^{-\nu(A)}\) is called the norm of \(A\); the integral part of \(A\) is defined as \(\sum_{\nu\leq n\leq 0}c_nq^n\). Among the applications, first a conjecture of Ramanujan is mentioned. It is an identity of an infinite product and an infinite series, where the sequence of primes occurs. Ramanujan crossed out this conjecture in his notebook, and the first author of the present paper disproved it, using a computer program. The remainder of the paper gives new proofs of identities known in the theory of partitions. Let us quote a few of them. Theorem 1. We have \(\prod^\infty_{n=1}(1+zq^n)= 1+\sum^\infty_{n=1} {z^nq^{n(n+1)/2} \over(1-q)(1-q^2)\cdots (1-q^n)}\). Theorem 4. We have \(\prod^\infty_{n=1} {1\over 1-q^n}= 1+\sum^\infty_{n=1} {q^{n^2}\over (1-q)^2(1-q^2)^2 \cdots (1-q^n)^2}\).
    0 references
    Engel series
    0 references
    formal Laurent series
    0 references
    identities
    0 references
    partitions
    0 references

    Identifiers