Sequentially congruent partitions and partitions into squares
Abstract
In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the mth part is congruent to the (m+1)th part modulo m, with the smallest part congruent to zero modulo the number of parts. Let p S(n) be the number of sequentially congruent partitions of n, and let p(n) be the number of partitions of n wherein all parts are squares. In this note we prove bijectively, for all n≥ 1, that p S(n) = p(n). Our proof naturally extends to show other exotic classes of partitions of n are in bijection with certain partitions of n into kth powers.
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.