2005
DOI: 10.1016/j.jcta.2004.06.013
|View full text |Cite
|
Sign up to set email alerts
|

Cranks and dissections in Ramanujan's lost notebook

Abstract: In his lost notebook, Ramanujan offers several results related to the crank, the existence of which was first conjectured by F. J. Dyson and later established by G.E. Andrews and F.G. Garvan. Using an obscure identity found on p. 59 of the lost notebook, we provide uniform proofs of several congruences in the ring of formal power series for the generating function F (q) of cranks. All are found, sometimes in abbreviated form, in the lost notebook, and imply dissections of F (q). Consequences of our work are in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0
1

Year Published

2006
2006
2013
2013

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 26 publications
(21 citation statements)
references
References 12 publications
0
20
0
1
Order By: Relevance
“…One area of research has been to try to evaluate R(q) for various q inside the unit circle, and indeed many explicit evaluations of R(e −π √ n ) and R(−e −π √ n ) have been given for n ∈ Q + , some of which were asserted by Ramanujan without proof (see, for example, [2], [3], [12] and [16]). …”
Section: 1mentioning
confidence: 99%
“…One area of research has been to try to evaluate R(q) for various q inside the unit circle, and indeed many explicit evaluations of R(e −π √ n ) and R(−e −π √ n ) have been given for n ∈ Q + , some of which were asserted by Ramanujan without proof (see, for example, [2], [3], [12] and [16]). …”
Section: 1mentioning
confidence: 99%
“…94-96] for proofs and a history of earlier proofs. Further references to other proofs of Ramanujan's five dissections for F a (q) and to proofs of certain other dissections of F a (q) can be found in [4]. The largest value of m for which a dissection of F a (q) has been given is m = 11.…”
Section: Dissections Of the Crankmentioning
confidence: 99%
“…Let N (m, n) denote the number of partitions of n with rank m, and let N (m, t, n) denote the number of partitions of n with rank congruent to m modulo t. Then Dyson conjectured that 4) and…”
Section: Dyson Ranks and Cranksmentioning
confidence: 99%
See 2 more Smart Citations