<p>The <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_977_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\,\textrm{pod}\,}}(n)\)</EquationSource> </InlineEquation> function, which counts the number of partitions of an integer <i>n</i> where the odd parts are distinct and the even parts are unrestricted, is regarded as one of the most celebrated restricted partition functions in the field. It finds mention in numerous works across various topics, such as lattice paths and Lie algebra. In this paper, we investigate the arithmetic behavior of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_977_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="59" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\,\textrm{pod}\,}}_{\ell }(n)\)</EquationSource> </InlineEquation>, the number of partitions of <i>n</i> into distinct <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_977_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="12" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell \)</EquationSource> </InlineEquation>-regular odd parts and unrestricted even parts, where <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_977_Article_IEq6.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell &gt;1\)</EquationSource> </InlineEquation> is odd. More precisely, we establish some congruences modulo 3,&#xa0;4 and 12 for <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_977_Article_IEq4.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="59" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\,\textrm{pod}\,}}_{\ell }(n)\)</EquationSource> </InlineEquation> for <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41478_2025_977_Article_IEq8.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="54" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell =3,9\)</EquationSource> </InlineEquation>. </p>

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

Arithmetic properties of partitions into distinct \(\ell \)-regular odd parts

  • Mohammed L. Nadji,
  • Moussa Ahmia

摘要

The \({{\,\textrm{pod}\,}}(n)\) function, which counts the number of partitions of an integer n where the odd parts are distinct and the even parts are unrestricted, is regarded as one of the most celebrated restricted partition functions in the field. It finds mention in numerous works across various topics, such as lattice paths and Lie algebra. In this paper, we investigate the arithmetic behavior of \({{\,\textrm{pod}\,}}_{\ell }(n)\) , the number of partitions of n into distinct \(\ell \) -regular odd parts and unrestricted even parts, where \(\ell >1\) is odd. More precisely, we establish some congruences modulo 3, 4 and 12 for \({{\,\textrm{pod}\,}}_{\ell }(n)\) for \(\ell =3,9\) .