Congruences and density results for partitions into distinct even parts

2025/03/08 by Nath, Hemjyoti, Sarma, Abhishek
#05A17 #11F11 #11P81 #11P83 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2503.06228

Abstract

In this paper, we consider the set of partitions ped(n) which counts the number of partitions of n wherein the even parts are distinct (and the odd parts are unrestricted). Using an algorithm developed by Radu, we prove congruences modulo 192 which were conjectured by Nath. Further, we prove a few infinite families of congruences modulo 24 by using a result of Newman. Also, we prove that ped(9n+7) is lacunary modulo 2^k+2⋅ 3 and 3^k+1⋅ 4 for all positive integers k≥0. We further prove an infinite family of congruences for ped(n) modulo arbitrary powers of 2 by employing a result of Ono and Taguchi on the nilpotency of Hecke operators.

Related

• Congruences for the number of partitions and bipartitions with distinct even parts
• Parity results of PEND partition
• Congruences for 9-regular partitions modulo 3
• On the arithmetic properties of partitions into parts simultaneously 4-regular and 9-distinct
• Arithmetic Properties of Partitions with 1-colored Even Parts and r-colored Odd Parts