Open AccessPARTITION CONGRUENCES AND DYSON’S RANK
Author(s) -
Sudipta Das
Publication year - 2014
Publication title -
international journal of research - granthaalayah
Language(s) - English
Resource type - Journals
eISSN - 2394-3629
pISSN - 2350-0530
DOI - 10.29121/granthaalayah.v2.i2.2014.3066
Subject(s) - congruence relation , partition (number theory) , ramanujan's sum , mathematics , modular form , combinatorics , rank (graph theory) , mathematical proof , ramanujan theta function , integer (computer science) , pure mathematics , computer science , geometry , programming language
In this article the rank of a partition of an integer is a certain integer associated with the partition. The term has first introduced by freeman Dyson in a paper published in Eureka in 1944. In 1944, F.S. Dyson discussed his conjectures related to the partitions empirically some Ramanujan’s famous partition congruences. In 1921, S. Ramanujan proved his famous partition congruences: The number of partitions of numbers 5n+4, 7n+5 and 11n +6 are divisible by 5, 7 and 11 respectively in another way. In 1944, Dyson defined the relations related to the rank of partitions. These are later proved by Atkin and Swinnerton-Dyer in 1954.
The proofs are analytic relying heavily on the properties of modular functions. This paper shows how to generate the generating functions for In this paper, we show how to prove the Dyson’s conjectures with rank of partitions.