<p>A partition of a positive integer <i>n</i> is said to be <i>t</i>-core if none of its hook lengths are divisible by <i>t</i>. Recently, two analogues, <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{a}}_t(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>a</mi> <mo>¯</mo> </mover> <mi>t</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq2.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{b}}_t(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>b</mi> <mo>¯</mo> </mover> <mi>t</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, of the <i>t</i>-core partition function, <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq3.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\(c_t(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>c</mi> <mi>t</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, have been introduced by Gireesh et al. (Acta Arith. 199:33-53, 2021) and Bandyopadhyay and Baruah (J. Integer Seq. 27:24, 2024), respectively. In this article, we prove the lacunarity of <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq4.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{b}}_t(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>b</mi> <mo>¯</mo> </mover> <mi>t</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> modulo arbitrary powers of 2 and 3 for <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq5.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="62" /> </InlineMediaObject> <EquationSource Format="TEX">\(t=3^\alpha m\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>=</mo> <msup> <mn>3</mn> <mi>α</mi> </msup> <mi>m</mi> </mrow> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq6.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="68" /> </InlineMediaObject> <EquationSource Format="TEX">\(\gcd (m,6)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo movablelimits="true">gcd</mo> <mo stretchy="false">(</mo> <mi>m</mi> <mo>,</mo> <mn>6</mn> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>=1. For a fixed positive integer <i>k</i> and prime numbers <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq7.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_i\ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation>, we also study the arithmetic density of <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq8.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="36" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{b}}_t(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>b</mi> <mo>¯</mo> </mover> <mi>t</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> modulo <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq9.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(p_i^k\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mi>p</mi> <mi>i</mi> <mi>k</mi> </msubsup> </math></EquationSource> </InlineEquation> where <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq10.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="101" /> </InlineMediaObject> <EquationSource Format="TEX">\(t=p_1^{a_1}\cdots p_m^{a_m}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>=</mo> <msubsup> <mi>p</mi> <mn>1</mn> <msub> <mi>a</mi> <mn>1</mn> </msub> </msubsup> <mo>⋯</mo> <msubsup> <mi>p</mi> <mi>m</mi> <msub> <mi>a</mi> <mi>m</mi> </msub> </msubsup> </mrow> </math></EquationSource> </InlineEquation>. We further find an infinite family of congruences for <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq11.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{b}}_3(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>b</mi> <mo>¯</mo> </mover> <mn>3</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> modulo arbitrary powers of 2 by employing a result of Ono and Taguchi on the nilpotency of Hecke operators. We also study the arithmetic density of <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq12.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{b}}_2(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>b</mi> <mo>¯</mo> </mover> <mn>2</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> and deduce some infinite families of congruences for <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11139_2024_1014_Article_IEq13.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="38" /> </InlineMediaObject> <EquationSource Format="TEX">\({\overline{b}}_2(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mover> <mi>b</mi> <mo>¯</mo> </mover> <mn>2</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> modulo 2 using Newman’s identity and a result of Keith and Zanello.</p>

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

Density results and congruences for an analogue of t-core partitions

  • Pranjal Talukdar

摘要

A partition of a positive integer n is said to be t-core if none of its hook lengths are divisible by t. Recently, two analogues, \({\overline{a}}_t(n)\) a ¯ t ( n ) and \({\overline{b}}_t(n)\) b ¯ t ( n ) , of the t-core partition function, \(c_t(n)\) c t ( n ) , have been introduced by Gireesh et al. (Acta Arith. 199:33-53, 2021) and Bandyopadhyay and Baruah (J. Integer Seq. 27:24, 2024), respectively. In this article, we prove the lacunarity of \({\overline{b}}_t(n)\) b ¯ t ( n ) modulo arbitrary powers of 2 and 3 for \(t=3^\alpha m\) t = 3 α m where \(\gcd (m,6)\) gcd ( m , 6 ) =1. For a fixed positive integer k and prime numbers \(p_i\ge 5\) p i 5 , we also study the arithmetic density of \({\overline{b}}_t(n)\) b ¯ t ( n ) modulo \(p_i^k\) p i k where \(t=p_1^{a_1}\cdots p_m^{a_m}\) t = p 1 a 1 p m a m . We further find an infinite family of congruences for \({\overline{b}}_3(n)\) b ¯ 3 ( n ) modulo arbitrary powers of 2 by employing a result of Ono and Taguchi on the nilpotency of Hecke operators. We also study the arithmetic density of \({\overline{b}}_2(n)\) b ¯ 2 ( n ) and deduce some infinite families of congruences for \({\overline{b}}_2(n)\) b ¯ 2 ( n ) modulo 2 using Newman’s identity and a result of Keith and Zanello.