New Infinite Families of Congruences Modulo Powers of 2 for 2--Regular Partitions with Designated Summands
Abstract
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence of a part. In that same work, Andrews, Lewis, and Lovejoy also studied such partitions wherein all parts must be odd. Recently, Herden, Sepanski, Stanfill, Hammon, Henningsen, Ickes, and Ruiz proved a number of Ramanujan--like congruences for the function PD2(n) which counts the number of partitions of weight n with designated summands wherein all parts must be odd. In this work, we prove some of the results conjectured by Herden, et. al. by proving the following two infinite families of congruences satisfied by PD2(n): For all α≥ 0 and n≥ 0, eqnarray* PD2(2α(4n+3)) & & 0 4 \ \ \ \ \ and \\ PD2(2α(8n+7)) & & 0 8. eqnarray* All of the proof techniques used herein are elementary, relying on classical q--series identities and generating function manipulations.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.