Dazhao Tang
Published 2017-09-08Version 1
The notion of broken $k$-diamond partitions was introduced by Andrews and Paule. Let $\Delta_{k}(n)$ denote the number of broken $k$-diamond partitions of $n$ for a fixed positive integer $k$. In this paper, we establish new infinite families of broken $k$-diamond partition congruences.
Congruences modulo powers of 5 for $k$-colored partitions
Infinite families of $2$-designs from a class of linear codes related to Dembowski-Ostrom functions
Erdös-Hajnal Conjecture for New Infinite Families of Tournaments
![QR code for arXiv:1709.02584 [math.CO]](http://oss.arxitics.com/images/favicon.svg)