Congruences in ordered pairs of partitions
暂无分享，去创建一个
Dyson defined the rank of a partition (as the first part minus the number of parts) whilst investigating certain congruences in the sequence p−1(n). The rank has been widely studied as have been other statistics, such as the crank. In this paper a “birank” is defined which relates to ordered pairs of partitions, and is used in an elementary proof of a congruence
in p−2(n)
[1] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[2] Frank G. Garvan,et al. New combinatorial interpretations of Ramanujan’s partition congruences mod 5,7 and 11 , 1988 .
[3] S. Ramanujan,et al. Congruence properties of partitions , 1921 .
[4] Peter Swinnerton-Dyer,et al. Some Properties of Partitions , 1954 .
[5] Frank G. Garvan. A number theoretic crank associated with open Bosonic strings , 1991 .