<p>Let <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1141_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="58" /> </InlineMediaObject> <EquationSource Format="TEX">\(c\phi _{k,h}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>c</mi> <msub> <mi>ϕ</mi> <mrow> <mi>k</mi> <mo>,</mo> <mi>h</mi> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of F-partitions of <i>n</i> that allow up to <i>h</i> repetitions of <i>k</i> copies of a nonnegative integer in a row. In this paper, we present generating functions for <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1141_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="57" /> </InlineMediaObject> <EquationSource Format="TEX">\(c\phi _{2,2}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>c</mi> <msub> <mi>ϕ</mi> <mrow> <mn>2</mn> <mo>,</mo> <mn>2</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1141_Article_IEq3.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="57" /> </InlineMediaObject> <EquationSource Format="TEX">\(c\phi _{2,3}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>c</mi> <msub> <mi>ϕ</mi> <mrow> <mn>2</mn> <mo>,</mo> <mn>3</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> in terms of <i>q</i>-products, and obtain several congruences modulo powers of 2 and 3 for these functions. For example, we find that for nonnegative integers <i>n</i> and <i>k</i>, <Equation ID="Equ75"> <MediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1141_Article_Equ75.gif" Format="GIF" Height="44" Rendition="HTML" Resolution="72" Type="Linedraw" Width="464" /> </MediaObject> <EquationSource Format="TEX">\(c\phi _{2,3}\left( 2\times 5^{2k+2}n+3\times \frac{5^{2k+2}-1}{4}+1\right) \equiv c\phi _{2,3}(2n+1)\pmod {8}.\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mi>c</mi> <msub> <mi>ϕ</mi> <mrow> <mn>2</mn> <mo>,</mo> <mn>3</mn> </mrow> </msub> <mfenced close=")" open="("> <mn>2</mn> <mo>×</mo> <msup> <mn>5</mn> <mrow> <mn>2</mn> <mi>k</mi> <mo>+</mo> <mn>2</mn> </mrow> </msup> <mi>n</mi> <mo>+</mo> <mn>3</mn> <mo>×</mo> <mfrac> <mrow> <msup> <mn>5</mn> <mrow> <mn>2</mn> <mi>k</mi> <mo>+</mo> <mn>2</mn> </mrow> </msup> <mo>-</mo> <mn>1</mn> </mrow> <mn>4</mn> </mfrac> <mo>+</mo> <mn>1</mn> </mfenced> <mo>≡</mo> <mi>c</mi> <msub> <mi>ϕ</mi> <mrow> <mn>2</mn> <mo>,</mo> <mn>3</mn> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mn>2</mn> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mspace width="10.0pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <mn>8</mn> <mo stretchy="false">)</mo> </mrow> <mo>.</mo> </mrow> </math></EquationSource> </Equation>We use properties of Ramanujan’s theta functions and integer matrix exact covering systems to arrive at our results.</p>

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

Some congruences for Frobenius partitions with k colors and h repetitions

  • Bipul Kumar Sarmah,
  • Satyajit Gayan

摘要

Let \(c\phi _{k,h}(n)\) c ϕ k , h ( n ) denote the number of F-partitions of n that allow up to h repetitions of k copies of a nonnegative integer in a row. In this paper, we present generating functions for \(c\phi _{2,2}(n)\) c ϕ 2 , 2 ( n ) and \(c\phi _{2,3}(n)\) c ϕ 2 , 3 ( n ) in terms of q-products, and obtain several congruences modulo powers of 2 and 3 for these functions. For example, we find that for nonnegative integers n and k, \(c\phi _{2,3}\left( 2\times 5^{2k+2}n+3\times \frac{5^{2k+2}-1}{4}+1\right) \equiv c\phi _{2,3}(2n+1)\pmod {8}.\) c ϕ 2 , 3 2 × 5 2 k + 2 n + 3 × 5 2 k + 2 - 1 4 + 1 c ϕ 2 , 3 ( 2 n + 1 ) ( mod 8 ) . We use properties of Ramanujan’s theta functions and integer matrix exact covering systems to arrive at our results.