<p>Let <i>p</i> be prime, and let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(p_{[1,p]}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mrow> <mo stretchy="false">[</mo> <mn>1</mn> <mo>,</mo> <mi>p</mi> <mo stretchy="false">]</mo> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> denote the function whose generating function is <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\prod (1-q^n)^{-1}(1 - q^{pn})^{-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>∏</mo> <msup> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>-</mo> <msup> <mi>q</mi> <mi>n</mi> </msup> <mo stretchy="false">)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> <msup> <mrow> <mo stretchy="false">(</mo> <mn>1</mn> <mo>-</mo> <msup> <mi>q</mi> <mrow> <mi mathvariant="italic">pn</mi> </mrow> </msup> <mo stretchy="false">)</mo> </mrow> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msup> </mrow> </math></EquationSource> </InlineEquation>. This function and its generalizations <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(p_{[c^{\ell }, d^m]}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mrow> <mo stretchy="false">[</mo> <msup> <mi>c</mi> <mi>ℓ</mi> </msup> <mo>,</mo> <msup> <mi>d</mi> <mi>m</mi> </msup> <mo stretchy="false">]</mo> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> are the subject of study in several recent papers. Let <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\ell \ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>ℓ</mi> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation>, let <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(j\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>j</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, and let <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(p \in \{2, 3, 5\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>5</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>. In this paper, we prove that the generating function for <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(p_{[1, p]}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>p</mi> <mrow> <mo stretchy="false">[</mo> <mn>1</mn> <mo>,</mo> <mi>p</mi> <mo stretchy="false">]</mo> </mrow> </msub> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> in the progression <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\beta _{p, \ell , j}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>β</mi> <mrow> <mi>p</mi> <mo>,</mo> <mi>ℓ</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </math></EquationSource> </InlineEquation> modulo <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(\ell ^j\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>ℓ</mi> <mi>j</mi> </msup> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(24\beta _{p, \ell , j} \equiv p + 1\ (\textrm{mod}\ \ell ^j)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>24</mn> <msub> <mi>β</mi> <mrow> <mi>p</mi> <mo>,</mo> <mi>ℓ</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mo>≡</mo> <mi>p</mi> <mo>+</mo> <mn>1</mn> <mspace width="4pt" /> <mrow> <mo stretchy="false">(</mo> <mtext>mod</mtext> <mspace width="4pt" /> <msup> <mi>ℓ</mi> <mi>j</mi> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> lies in a Hecke-invariant subspace of type <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\{\eta (Dz)\eta (Dpz)F(Dz): F(z) \in M_{s}(\Gamma _0(p), \chi )\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mi>η</mi> <mrow> <mo stretchy="false">(</mo> <mi>D</mi> <mi>z</mi> <mo stretchy="false">)</mo> </mrow> <mi>η</mi> <mrow> <mo stretchy="false">(</mo> <mi>D</mi> <mi>p</mi> <mi>z</mi> <mo stretchy="false">)</mo> </mrow> <mi>F</mi> <mrow> <mo stretchy="false">(</mo> <mi>D</mi> <mi>z</mi> <mo stretchy="false">)</mo> </mrow> <mo>:</mo> <mi>F</mi> <mrow> <mo stretchy="false">(</mo> <mi>z</mi> <mo stretchy="false">)</mo> </mrow> <mo>∈</mo> <msub> <mi>M</mi> <mi>s</mi> </msub> <mrow> <mo stretchy="false">(</mo> <msub> <mi mathvariant="normal">Γ</mi> <mn>0</mn> </msub> <mrow> <mo stretchy="false">(</mo> <mi>p</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mi>χ</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> for suitable <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(D\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>D</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(s\ge 0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>s</mi> <mo>≥</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation>, and character&#xa0;<InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(\chi \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>χ</mi> </math></EquationSource> </InlineEquation>. When <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(p\in \{2, 3, 5\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>∈</mo> <mo stretchy="false">{</mo> <mn>2</mn> <mo>,</mo> <mn>3</mn> <mo>,</mo> <mn>5</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation>, we use the Hecke-invariance of these subspaces proved in [<CitationRef CitationID="CR21">21</CitationRef>] to prove, for distinct primes <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\ell \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ℓ</mi> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(m\ge 5\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>≥</mo> <mn>5</mn> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(j\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>j</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>, congruences of the form <Equation ID="Equ79"> <EquationSource Format="TEX">\(\begin{aligned} p_{[1, p]}\left( \frac{\ell ^jm^k n +1}{D}\right) \equiv 0\ (\textrm{mod}\ \ell ^j) \end{aligned}\)</EquationSource> <EquationSource Format="MATHML"><math display="block"> <mrow> <mtable> <mtr> <mtd columnalign="right"> <mrow> <msub> <mi>p</mi> <mrow> <mo stretchy="false">[</mo> <mn>1</mn> <mo>,</mo> <mi>p</mi> <mo stretchy="false">]</mo> </mrow> </msub> <mfenced close=")" open="("> <mfrac> <mrow> <msup> <mi>ℓ</mi> <mi>j</mi> </msup> <msup> <mi>m</mi> <mi>k</mi> </msup> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> <mi>D</mi> </mfrac> </mfenced> <mo>≡</mo> <mn>0</mn> <mspace width="4pt" /> <mrow> <mo stretchy="false">(</mo> <mtext>mod</mtext> <mspace width="4pt" /> <msup> <mi>ℓ</mi> <mi>j</mi> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> </mrow> </math></EquationSource> </Equation>for all <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(n\ge 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>≥</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(m\not \mid n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>∤</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>, where <i>k</i> is explicitly computable and depends on the forms in the invariant subspace. Our proofs require adapting and extending analogous level one results on <i>p</i>(<i>n</i>) in [<CitationRef CitationID="CR1">1</CitationRef>] and [<CitationRef CitationID="CR22">22</CitationRef>] to level <i>p</i>.</p>

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

Congruence properties modulo prime powers for a class of partition functions

  • Matthew Boylan,
  • Swati

摘要

Let p be prime, and let \(p_{[1,p]}(n)\) p [ 1 , p ] ( n ) denote the function whose generating function is \(\prod (1-q^n)^{-1}(1 - q^{pn})^{-1}\) ( 1 - q n ) - 1 ( 1 - q pn ) - 1 . This function and its generalizations \(p_{[c^{\ell }, d^m]}(n)\) p [ c , d m ] ( n ) are the subject of study in several recent papers. Let \(\ell \ge 5\) 5 , let \(j\ge 1\) j 1 , and let \(p \in \{2, 3, 5\}\) p { 2 , 3 , 5 } . In this paper, we prove that the generating function for \(p_{[1, p]}(n)\) p [ 1 , p ] ( n ) in the progression \(\beta _{p, \ell , j}\) β p , , j modulo \(\ell ^j\) j with \(24\beta _{p, \ell , j} \equiv p + 1\ (\textrm{mod}\ \ell ^j)\) 24 β p , , j p + 1 ( mod j ) lies in a Hecke-invariant subspace of type \(\{\eta (Dz)\eta (Dpz)F(Dz): F(z) \in M_{s}(\Gamma _0(p), \chi )\}\) { η ( D z ) η ( D p z ) F ( D z ) : F ( z ) M s ( Γ 0 ( p ) , χ ) } for suitable \(D\ge 1\) D 1 , \(s\ge 0\) s 0 , and character  \(\chi \) χ . When \(p\in \{2, 3, 5\}\) p { 2 , 3 , 5 } , we use the Hecke-invariance of these subspaces proved in [21] to prove, for distinct primes \(\ell \) and \(m\ge 5\) m 5 and \(j\ge 1\) j 1 , congruences of the form \(\begin{aligned} p_{[1, p]}\left( \frac{\ell ^jm^k n +1}{D}\right) \equiv 0\ (\textrm{mod}\ \ell ^j) \end{aligned}\) p [ 1 , p ] j m k n + 1 D 0 ( mod j ) for all \(n\ge 1\) n 1 with \(m\not \mid n\) m n , where k is explicitly computable and depends on the forms in the invariant subspace. Our proofs require adapting and extending analogous level one results on p(n) in [1] and [22] to level p.