Congruences for Overcubic Partition k-Tuples

Abstract

In the last few years, a number of authors have proved divisibility properties satisfied by various functions which count the number of overcubic partition k--tuples of weight n for small values of k. In this work, we use generating functions to prove some of their results as well as multiple infinite families of new congruences for overcubic partition k-tuples which do not yet appear in the literature. In particular, we focus on a new perspective which provides insights as to why these functions are often divisible by powers of 2, and we also prove families of congruences whose moduli are odd. For example, we prove that, for all m≥ 0, b4(22m + 11) 0 11 and we also prove infinite families such as b9l+2(9m+3) 0 3 for all m,l≥0.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…