<p>Dyson’s rank of a partition witnesses Ramanujan’s first two congruences for <i>p</i>(<i>n</i>): <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1413_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="164" /> </InlineMediaObject> <EquationSource Format="TEX">\(p(5n+4)\equiv 0\pmod 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo stretchy="false">(</mo> <mn>5</mn> <mi>n</mi> <mo>+</mo> <mn>4</mn> <mo stretchy="false">)</mo> <mo>≡</mo> <mn>0</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>5</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10801_2025_1413_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="164" /> </InlineMediaObject> <EquationSource Format="TEX">\(p(7n+5)\equiv 0\pmod 7\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo stretchy="false">(</mo> <mn>7</mn> <mi>n</mi> <mo>+</mo> <mn>5</mn> <mo stretchy="false">)</mo> <mo>≡</mo> <mn>0</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>7</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. However, the 5- and 7-divisibility outside of these arithmetic progressions is not always witnessed by the rank. In this paper, we find statistics witnessing <i>every</i> instance of <i>m</i>-divisibility of <i>P</i>(<i>n</i>,&#xa0;<i>d</i>), the number of partitions of <i>n</i> into exactly <i>d</i> parts. We call these statistics “supercranks," and we give several examples. We conjecture that these examples, along with just one other known supercrank, are the only supercranks for <i>P</i>(<i>n</i>,&#xa0;<i>d</i>) modulo any <i>m</i>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Supercranks for partitions with a fixed number of parts

  • Dennis Eichhorn,
  • Brandt Kronholm

摘要

Dyson’s rank of a partition witnesses Ramanujan’s first two congruences for p(n): \(p(5n+4)\equiv 0\pmod 5\) p ( 5 n + 4 ) 0 ( mod 5 ) and \(p(7n+5)\equiv 0\pmod 7\) p ( 7 n + 5 ) 0 ( mod 7 ) . However, the 5- and 7-divisibility outside of these arithmetic progressions is not always witnessed by the rank. In this paper, we find statistics witnessing every instance of m-divisibility of P(nd), the number of partitions of n into exactly d parts. We call these statistics “supercranks," and we give several examples. We conjecture that these examples, along with just one other known supercrank, are the only supercranks for P(nd) modulo any m.