Abstract

In 1944, Freeman Dyson conjectured the existence of a “crank” function for partitions that would provide a combinatorial result of Ramanujan’s congruence modulo 11. In 1988, Andrews and Garvan stated such functions and described the celebrated result that the crank simultaneously explains the three Ramanujan congruences modulo 5, 7 and 11. Dyson wrote the article, titled Some Guesses in the theory of partitions, for Eureka, the undergraduate mathematics journal of Cambridge. He discovered the many conjectures in this article by attempting to find a combinatorial explanation of Ramanujan’s famous congruences for P (n), the number of partitions of n indeed, Ramanujan’s formulas lay unread until 1976 when Dyson found In the Trainty College Library of Cambridge University among papers from the estate of the late G.N.Watson. In 1986, F.Garvan wrote his Pennsylvania state Ph.D. Thesis Precisely on the formulas of Ramanujan relative to the crank. In view of this theoretical description, the story of the crank is a long romantic tale and the crank functions are intimately connected to all partitions congruences. In 2005, Mahlburg stated that the crank functions themselves obey Ramanujan type congruences.

Highlights

  • We give some related definitions of P(n), crank of partitions, x, zx, x 2 ; x and M m, n

  • This paper shows how to find the cranks of partitions of integers 7 and 8 by using tables 1 and 2 respectively and generate the generating functions for M(m, n) and M(o, n)

  • M m, t, n : The numbers of partitions of n with crank congruent to m modulo t is denoted by M m, t, n

Read more

Summary

INTRODUCTION

This paper shows how to find the cranks of partitions of integers 7 and 8 by using tables 1 and 2 respectively and generate the generating functions for M(m, n) and M(o, n). This paper shows how to prove the Theorem 1 related the crank of partitions by taking individual function and describe the vector partitions of n. In this paper we prove the Mathematical results 1, 2, and 3 discovered by Dyson with the help of classification of the partitions of 9, 12, and 17 respectively and prove the Dyson’s results with the help of examples. These results 4, 5 and 6 are combinatorial results of Ramanujan’s famous partition congruences modulo 5, 7 and 11 respectively. After the proof of Result-4 we show the relation between P (n) and M V m, n with the help of example

Some related definitions:
CRANKS OF PARTITIONS OF INTEGERS 7 AND 8
MATHEMATICAL RESULTS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call