Sequentially congruent partitions and partitions into squares
A partition \(\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_r), \lambda_1\ge\lambda_2\ge\ldots\lambda_r\ge 1\), of a positive integer \(n\) is sequentially congruent if: (i) \(\lambda_i\equiv\lambda_{i+1}(\mod {i})\) for \(1\le i\le r-1\) and (ii) \(\lambda_r\equiv 0(\mod {r})\). From the authors' abstract: ``Let \(p_{\mathcal{S}}(n)\) be the number of sequentially congruent partitions of \(n\), and let \(p_{\Box}(n)\) be the number of partitions of \(n\) wherein all parts are squares. In this note we prove bijectively, for all \(n\ge 1\), that \(p_{\mathcal{S}}(n)=p_{\Box}(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.
- On non-squashing partitions
- Sequentially congruent partitions and related bijections
- scientific article; zbMATH DE number 786183 (Why is no real title available?)
- Sequences in partitions
- Bijections, generalizations, and other properties of sequentially congruent partitions
- Squares from blocks of consecutive integers: a problem of Erdős and Graham
- Composition-theoretic series in partition theory
This page was built for publication: Sequentially congruent partitions and partitions into squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052852)