<p>In 1984, Andrews introduced the family of <i>k</i>-colored generalized Frobenius partition functions. For any <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="42" /> </InlineMediaObject> <EquationSource Format="TEX">\(k\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, let <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(c\phi _k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>c</mi> <msub> <mi>ϕ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the number of <i>k</i>-colored generalized Frobenius partitions of <i>n</i>, and let <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="52" /> </InlineMediaObject> <EquationSource Format="TEX">\(\text {C}\Phi _k(q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>C</mtext> <msub> <mi mathvariant="normal">Φ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> represent its generating function. Baruah and Sarmah derived integral expressions for <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="52" /> </InlineMediaObject> <EquationSource Format="TEX">\(\text {C}\Phi _k(q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>C</mtext> <msub> <mi mathvariant="normal">Φ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq5.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="91" /> </InlineMediaObject> <EquationSource Format="TEX">\(k\in \{4,5,6\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>k</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>4</mn> <mo>,</mo> <mn>5</mn> <mo>,</mo> <mn>6</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> by applying the method of integer matrix exact covering systems developed by Cao. Subsequently, Chan, Wang and Yang systematically investigated the generating function of <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="48" /> </InlineMediaObject> <EquationSource Format="TEX">\(c\phi _k(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>c</mi> <msub> <mi>ϕ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> by utilizing the theory of modular forms. In this paper, we propose a unified framework to derive expressions for <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="52" /> </InlineMediaObject> <EquationSource Format="TEX">\(\text {C}\Phi _k(q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>C</mtext> <msub> <mi mathvariant="normal">Φ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> with integral coefficients, extending several known results about <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2025_1176_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="52" /> </InlineMediaObject> <EquationSource Format="TEX">\(\text {C}\Phi _k(q)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mtext>C</mtext> <msub> <mi mathvariant="normal">Φ</mi> <mi>k</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>q</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>.</p>

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

Integer matrix exact covering systems and k-colored generalized Frobenius partitions

  • Su-Ping Cui,
  • Nancy S. S. Gu,
  • Dazhao Tang

摘要

In 1984, Andrews introduced the family of k-colored generalized Frobenius partition functions. For any \(k\ge 1\) k 1 , let \(c\phi _k(n)\) c ϕ k ( n ) denote the number of k-colored generalized Frobenius partitions of n, and let \(\text {C}\Phi _k(q)\) C Φ k ( q ) represent its generating function. Baruah and Sarmah derived integral expressions for \(\text {C}\Phi _k(q)\) C Φ k ( q ) with \(k\in \{4,5,6\}\) k { 4 , 5 , 6 } by applying the method of integer matrix exact covering systems developed by Cao. Subsequently, Chan, Wang and Yang systematically investigated the generating function of \(c\phi _k(n)\) c ϕ k ( n ) by utilizing the theory of modular forms. In this paper, we propose a unified framework to derive expressions for \(\text {C}\Phi _k(q)\) C Φ k ( q ) with integral coefficients, extending several known results about \(\text {C}\Phi _k(q)\) C Φ k ( q ) .