vix.ing · top · new · best · stats · spec

Elementary proof of congruences modulo 25 for broken k-diamond partitions

2018/07/05 by Chern, Shane, Tang, Dazhao
#05A17 #11P83 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1807.01890

Abstract

Let Δk(n) denote the number of k-broken diamond partitions of n. Quite recently, the second author proved an infinite family of congruences modulo 25 for Δk(n) with the help of modular forms. In this paper, we aim to provide an elementary proof of this result.

Related