Sequentially congruent partitions and partitions into squares
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:BV6XQUH3record.jsonopen to challenge →
read the original abstract
In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th 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_{\mathcal S}(n)$ be the number of sequentially congruent partitions of $n,$ and let $p_{\square}(n)$ be the number of partitions of $n$ wherein all parts are squares. In this note we prove bijectively, for all $n\geq 1,$ that $p_{\mathcal S}(n) = p_{\square}(n).$ Our proof naturally extends to show other exotic classes of partitions of $n$ are in bijection with certain partitions of $n$ into $k$th powers.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.