<p>Recently, Beck introduced two partition statistics <i>NT</i>(<i>r</i>,&#xa0;<i>m</i>,&#xa0;<i>n</i>) and <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1996_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="85" /> </InlineMediaObject> <EquationSource Format="TEX">\(M_{\omega }(r,m,n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>M</mi> <mi>ω</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>r</mi> <mo>,</mo> <mi>m</mi> <mo>,</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, which count the total number of parts in partitions of <i>n</i> with rank congruent to <i>r</i> modulo <i>m</i> and the total number of ones in the partitions of <i>n</i> with crank congruent to <i>r</i> modulo <i>m</i>, respectively. He also posed two conjectures on <i>NT</i>(<i>r</i>,&#xa0;<i>m</i>,&#xa0;<i>n</i>) which were confirmed by Andrews. Very recently, Chern discovered a number of Andrews-Beck type congruences on <i>NT</i>(<i>r</i>,&#xa0;<i>m</i>,&#xa0;<i>n</i>) and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1996_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="85" /> </InlineMediaObject> <EquationSource Format="TEX">\(M_{\omega }(r,m,n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>M</mi> <mi>ω</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>r</mi> <mo>,</mo> <mi>m</mi> <mo>,</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and some of them were conjectured by Chan, Mao and Osburn. Inspired by Chern’s work, we prove many new Andrews-Beck type congruences modulo 7, 11 and 13 on linear combinations of <i>NT</i>(<i>r</i>,&#xa0;<i>m</i>,&#xa0;<i>n</i>) and <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40840_2025_1996_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="85" /> </InlineMediaObject> <EquationSource Format="TEX">\(M_{\omega }(r,m,n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>M</mi> <mi>ω</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>r</mi> <mo>,</mo> <mi>m</mi> <mo>,</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> in this paper.</p>

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

New Andrews-Beck Type Congruences Modulo 7, 11 and 13 on Linear Combinations of Beck’s Partition Statistics

  • Yongqiang Chen,
  • Olivia X. M. Yao

摘要

Recently, Beck introduced two partition statistics NT(rmn) and \(M_{\omega }(r,m,n)\) M ω ( r , m , n ) , which count the total number of parts in partitions of n with rank congruent to r modulo m and the total number of ones in the partitions of n with crank congruent to r modulo m, respectively. He also posed two conjectures on NT(rmn) which were confirmed by Andrews. Very recently, Chern discovered a number of Andrews-Beck type congruences on NT(rmn) and \(M_{\omega }(r,m,n)\) M ω ( r , m , n ) and some of them were conjectured by Chan, Mao and Osburn. Inspired by Chern’s work, we prove many new Andrews-Beck type congruences modulo 7, 11 and 13 on linear combinations of NT(rmn) and \(M_{\omega }(r,m,n)\) M ω ( r , m , n ) in this paper.