报告时间：2021年3月17日（星期三）9:30-10:30

报告地点：腾讯会议 ID：743 305 326 密码：1234 腾讯会议链接https://meeting.tencent.com/s/7h8Ews1aVgBV

报告人: 林丽双(集美大学)

报告摘要：Recently, Beck conjectured a new type of congruence involving Dyson’s rank and the number of parts of the partition. Later, Andrews confirmed Beck’s conjectures, Chern established the analogue results on crank. Moreover, Chan, Mao and Osburn considered three Andrews-Beck type congruences on overpartition and partition without repeated odd parts. In this talk, we will present combinatorial proof of two nice relations on rank and crank obtained by Chern, and then introduce our work on k-colored partitions. (This work joint with Lin Peng and Pee Choon Toh)

欢迎参加！

邀请人：毛仁荣