Sequentially congruent partitions and partitions into squares

From MaRDI portal
Publication:2052852

DOI10.1007/S11139-020-00294-7zbMATH Open1497.11258arXiv1911.10236OpenAlexW3044606054WikidataQ114223580 ScholiaQ114223580MaRDI QIDQ2052852FDOQ2052852


Authors: Robert Schneider, James A. Sellers, Ian Wagner Edit this on Wikidata


Publication date: 29 November 2021

Published in: The Ramanujan Journal (Search for Journal in Brave)

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 pmathcalS(n) be the number of sequentially congruent partitions of n, and let psquare(n) be the number of partitions of n wherein all parts are squares. In this note we prove bijectively, for all ngeq1, that pmathcalS(n)=psquare(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.


Full work available at URL: https://arxiv.org/abs/1911.10236




Recommendations




Cites Work


Cited In (7)





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)