CRANKS FOR PARTITIONS WITH BOUNDED LARGEST PART

被引:0
|
作者
Eichhorn, Dennis [1 ]
Kronholm, Brandt [2 ]
Larsen, Acadia [3 ]
机构
[1] Univ Calif Irvine, Dept Math, Irvine, CA 92697 USA
[2] Univ Texas Rio Grande Valley, Sch Math & Stat, Edinburg, TX 78539 USA
[3] Univ Calif Davis, Dept Math, California, CA 95616 USA
关键词
Partitions; congruences; rank; crank; Ramanujan; Dyson;
D O I
10.1090/proc/16399
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For 80 years, Dyson's rank has been known as the partition statis-tic that witnesses the first two of Ramanujan's celebrated congruences for the ordinary partition function. In this paper, we show that Dyson's rank actu-ally witnesses families of partition congruences modulo every prime P. This comes from an in-depth study of when a "multiplicity-based statistic" is a crank witnessing congruences for the function p`n, m, which enumerates par-titions of n with parts of size at most m. We also show that as the modulus P increases, there is an ever-growing collection of distinct multiplicity-based cranks witnessing these same families.
引用
收藏
页码:3291 / 3303
页数:13
相关论文
共 50 条