<p>Let <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="56" /> </InlineMediaObject> <EquationSource Format="TEX">\({{B_{\ell ,m}}(n)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>B</mi> <mrow> <mi>ℓ</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\((\ell , m)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi>ℓ</mi> <mo>,</mo> <mi>m</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>-regular bipartitions of <i>n</i>. We establish some congruence relations for <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq5.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="56" /> </InlineMediaObject> <EquationSource Format="TEX">\({{B_{\ell ,m}}(n)}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>B</mi> <mrow> <mi>ℓ</mi> <mo>,</mo> <mi>m</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> by employing the theory of modular forms. For example, let <i>m</i> be a positive integer such that <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="125" /> </InlineMediaObject> <EquationSource Format="TEX">\(m \equiv -1 \pmod 8\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≡</mo> <mo>-</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>8</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, we find that for all <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq7.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(n \ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, the following Ramanujan-type congruences hold: <Equation ID="Equ63"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_Equ63.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="195" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} {{B_{5,m}}\left( {5n + 3} \right) } \equiv 0 \pmod 5. \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <mrow> <msub> <mi>B</mi> <mrow> <mn>5</mn> <mo>,</mo> <mi>m</mi> </mrow> </msub> <mfenced close=")" open="("> <mrow> <mn>5</mn> <mi>n</mi> <mo>+</mo> <mn>3</mn> </mrow> </mfenced> </mrow> <mo>≡</mo> <mn>0</mn> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>5</mn> <mo stretchy="false">)</mo> </mrow> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>Letting <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq8.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="127" /> </InlineMediaObject> <EquationSource Format="TEX">\(p \equiv -1 \pmod {24}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≡</mo> <mo>-</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>24</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> be a prime, we also prove that for all <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq9.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="43" /> </InlineMediaObject> <EquationSource Format="TEX">\(n \ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_IEq10.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(k \ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, <Equation ID="Equ64"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1051_Article_Equ64.gif" Format="GIF" Height="54" Rendition="HTML" Resolution="72" Type="Linedraw" Width="362" /> </MediaObject> <EquationSource Format="TEX">\(\begin{aligned} {B_{3,p}}\left( {{p^k}n + \frac{{\left( {p + 1} \right) \left( {{p^k} - 1} \right) }}{{24}}} \right) \equiv {B_{3,p}}(n)\pmod 3. \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msub> <mi>B</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>p</mi> </mrow> </msub> <mfenced close=")" open="("> <mrow> <msup> <mi>p</mi> <mi>k</mi> </msup> <mi>n</mi> <mo>+</mo> <mfrac> <mrow> <mfenced close=")" open="("> <mrow> <mi>p</mi> <mo>+</mo> <mn>1</mn> </mrow> </mfenced> <mfenced close=")" open="("> <mrow> <msup> <mi>p</mi> <mi>k</mi> </msup> <mo>-</mo> <mn>1</mn> </mrow> </mfenced> </mrow> <mn>24</mn> </mfrac> </mrow> </mfenced> <mo>≡</mo> <msub> <mi>B</mi> <mrow> <mn>3</mn> <mo>,</mo> <mi>p</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>3</mn> <mo stretchy="false">)</mo> </mrow> <mo>.</mo> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation></p>

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

Congruence properties for \((\ell , m)\)-regular bipartitions

  • Jing-Jun Yu

摘要

Let \({{B_{\ell ,m}}(n)}\) B , m ( n ) denote the number of \((\ell , m)\) ( , m ) -regular bipartitions of n. We establish some congruence relations for \({{B_{\ell ,m}}(n)}\) B , m ( n ) by employing the theory of modular forms. For example, let m be a positive integer such that \(m \equiv -1 \pmod 8\) m - 1 ( mod 8 ) , we find that for all \(n \ge 0\) n 0 , the following Ramanujan-type congruences hold: \(\begin{aligned} {{B_{5,m}}\left( {5n + 3} \right) } \equiv 0 \pmod 5. \end{aligned}\) B 5 , m 5 n + 3 0 ( mod 5 ) . Letting \(p \equiv -1 \pmod {24}\) p - 1 ( mod 24 ) be a prime, we also prove that for all \(n \ge 0\) n 0 and \(k \ge 0\) k 0 , \(\begin{aligned} {B_{3,p}}\left( {{p^k}n + \frac{{\left( {p + 1} \right) \left( {{p^k} - 1} \right) }}{{24}}} \right) \equiv {B_{3,p}}(n)\pmod 3. \end{aligned}\) B 3 , p p k n + p + 1 p k - 1 24 B 3 , p ( n ) ( mod 3 ) .