Generalizations of Stanley’s Theorem: Combinatorial Proofs and Related Inequalities

Abstract

We consider the number of the 6-regular partitions of n, b6(n), and give infinite families of congruences modulo 3 (in arithmetic progression) for b6(n). We also consider the number of the partitions of n into distinct parts not congruent to ±2 modulo 6, Q2(n), and investigate connections between b6(n) and Q2(n) providing new combinatorial interpretations for these partition functions. In this context, we discover new infinite families of linear inequalities involving Euler's partition function p(n). Infinite families of linear inequalities involving the 6-regular partition function b6(n) and the distinct partition function Q2(n) are proposed as open problems.