»ã±¨±êÌâ(Title)£ºAndrews-Beck partition statistics£¨Andrews-Beck ·Ö²ðͳ¼ÆÁ¿£©

»ã±¨ÈË (Speaker)£ºÃ«ÈÊÈÙ ¸±½ÌÊÚ ËÕÖÝ´óѧ

»ã±¨¹¦·ò£¨Time£©£º2023Äê10ÔÂ14ÈÕ 15:00

»ã±¨µØÖ· (Place)£ºÐ£±¾²¿A123

Ô¼ÇëÈË(Inviter)£º³Âµ©µ©

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£º

Let $NT(m,k,n)$ (Andrews-Beck partition statistics) denote the total number of parts in the partitions of $n$ with rank congruent to $m$ modulo $k$. Andrews recently provided a $q$-series proof of congruences for $NT(m,k,n)$ modulo $5$ and $7$. Motivated by Andrews¡¯ works, Andrews-Beck partition statistics are widely studied by many authors recently. In this talk, we give a brief introduction to these partition statistics.