<p>In recent work with Raum, the authors considered congruences for the ordinary partition function <i>p</i>(<i>n</i>) of the form <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1245_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="184" /> </InlineMediaObject> <EquationSource Format="TEX">\(p(\ell Q^r n+\beta )\equiv 0\pmod \ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mrow> <mo stretchy="false">(</mo> <mi>ℓ</mi> <msup> <mi>Q</mi> <mi>r</mi> </msup> <mi>n</mi> <mo>+</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> <mo>≡</mo> <mn>0</mn> <mspace width="4.44443pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mi>ℓ</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1245_Article_IEq2.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="61" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell , Q\ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ℓ</mi> <mo>,</mo> <mi>Q</mi> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> are prime and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1245_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="75" /> </InlineMediaObject> <EquationSource Format="TEX">\(r\in \{1,2\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>1</mn> <mo>,</mo> <mn>2</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>, and proved a number of results which show that such congruences are scarce in a precise sense. Here we improve one of our results when <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1245_Article_IEq4.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="40" /> </InlineMediaObject> <EquationSource Format="TEX">\(r=1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>r</mi> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>; in particular, we prove (outside of trivial cases) that the set of primes <i>Q</i> such that there exists <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1245_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="45" /> </InlineMediaObject> <EquationSource Format="TEX">\(\beta \in \mathbb {Z}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>β</mi> <mo>∈</mo> <mi mathvariant="double-struck">Z</mi> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1245_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="178" /> </InlineMediaObject> <EquationSource Format="TEX">\(p(\ell Q n+\beta )\equiv 0\pmod \ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo stretchy="false">(</mo> <mi>ℓ</mi> <mi>Q</mi> <mi>n</mi> <mo>+</mo> <mi>β</mi> <mo stretchy="false">)</mo> <mo>≡</mo> <mn>0</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mi>ℓ</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> for all <i>n</i> has density zero. The proof involves a modification of part of our previous argument and an application of a recent theorem of Dicks regarding modular forms of half-integral weight and level one modulo <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1245_Article_IEq7.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation>.</p>

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

Scarcity of partition congruences on semiprime progressions

  • Scott Ahlgren,
  • Olivia Beckwith

摘要

In recent work with Raum, the authors considered congruences for the ordinary partition function p(n) of the form \(p(\ell Q^r n+\beta )\equiv 0\pmod \ell \) p ( Q r n + β ) 0 ( mod ) where \(\ell , Q\ge 5\) , Q 5 are prime and \(r\in \{1,2\}\) r { 1 , 2 } , and proved a number of results which show that such congruences are scarce in a precise sense. Here we improve one of our results when \(r=1\) r = 1 ; in particular, we prove (outside of trivial cases) that the set of primes Q such that there exists \(\beta \in \mathbb {Z}\) β Z with \(p(\ell Q n+\beta )\equiv 0\pmod \ell \) p ( Q n + β ) 0 ( mod ) for all n has density zero. The proof involves a modification of part of our previous argument and an application of a recent theorem of Dicks regarding modular forms of half-integral weight and level one modulo \(\ell \) .