Parity results for 13-regular partitions and broken 6-diamond partitions (Q1694379): Difference between revisions

A partition of \(n\) is called \(\ell\)-regular if none of its parts is divisible by \(\ell\). The properties of the \(\ell\)-regular partitions of \(n\) have been widely studied in recent years. In this paper, the authors considered the \(13\)-regular partitions of \(n\) and proved several infinite families of congruences modulo \(2\) for the number of these partitions, \(b_{13}(n)\). The broken \(k\)-diamond partitions were introduced by \textit{G. E. Andrews} and \textit{P. Paule} [Acta Arith. 126, No. 3, 281--294 (2007; Zbl 1110.05010)] as a new class of combinatorial objects. In the last eight years, the partition function \(\Delta_k(n)\) that counts the broken \(k\)-diamond partitions of \(n\) received considerable attention especially in combinatorics and number theory. The authors provide an elementary proof of a parity result on \(\Delta_6(n)\) which was established by \textit{S. Radu} and \textit{J. A. Sellers} [Acta Arith. 146, No. 1, 43--52 (2011; Zbl 1226.11112)] and give a new congruence relation modulo \(2\) for \(\Delta_6(n)\).