<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1147_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{spt2}}(n) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mrow> <mi>s</mi> <mi>p</mi> <mi>t</mi> <mn>2</mn> </mrow> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of smallest parts in the overpartitions of <i>n</i> where the smallest part is not overlined and the smallest part is even. In recent years, congruence properties for certain SPT functions including <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1147_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{spt2}}(n) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mrow> <mi>s</mi> <mi>p</mi> <mi>t</mi> <mn>2</mn> </mrow> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> have attracted the attention of many mathematicians. Motivated by their works, in this paper, we give characterizations of congruences modulo 2 and 4 for <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1147_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{spt2}}(n) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mrow> <mi>s</mi> <mi>p</mi> <mi>t</mi> <mn>2</mn> </mrow> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> by using an identity involving the second order mock theta function <i>B</i>(<i>q</i>) due to Gu and Su, and the generating function for <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1147_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="80" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{M2}}(r,4,n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mrow> <mi>M</mi> <mn>2</mn> </mrow> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>r</mi> <mo>,</mo> <mn>4</mn> <mo>,</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> which denotes the number of overpartitions of <i>n</i> where the second residual crank is congruent to <i>r</i> modulo 4.</p>

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

Characterizations of congruences modulo 2 and 4 for the number of smallest parts in overpartitions with smallest part even

  • Jing Jin,
  • Eric H. Liu,
  • Ernest X. W. Xia

摘要

Let \({\overline{spt2}}(n) \) s p t 2 ¯ ( n ) denote the number of smallest parts in the overpartitions of n where the smallest part is not overlined and the smallest part is even. In recent years, congruence properties for certain SPT functions including \({\overline{spt2}}(n) \) s p t 2 ¯ ( n ) have attracted the attention of many mathematicians. Motivated by their works, in this paper, we give characterizations of congruences modulo 2 and 4 for \({\overline{spt2}}(n) \) s p t 2 ¯ ( n ) by using an identity involving the second order mock theta function B(q) due to Gu and Su, and the generating function for \({\overline{M2}}(r,4,n)\) M 2 ¯ ( r , 4 , n ) which denotes the number of overpartitions of n where the second residual crank is congruent to r modulo 4.