<p>We prove multiplicative congruences mod <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(2^{12}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mn>2</mn> <mn>12</mn> </msup> </math></EquationSource> </InlineEquation> for George Andrews’s partition function, <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\overline{\mathcal{E}\mathcal{O}}(n)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mover> <mrow> <mi mathvariant="script">E</mi> <mi mathvariant="script">O</mi> </mrow> <mo>¯</mo> </mover> <mrow> <mo stretchy="false">(</mo> <mi>n</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, the number of partitions of <i>n</i> in which every even part is less than each odd part and only the largest even part occurs an odd number of times. We find analogous congruences for more general infinite products. These congruences, inspired by Atkin’s multiplicative congruences for the partition function, are obtained using Fricke involutions and Newman’s approach to half integer weight Hecke operators on eta quotients.</p>

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

Multiplicative congruences for Andrews’s even parts below odd parts function and related infinite products

  • F. G. Garvan,
  • Connor Morrow

摘要

We prove multiplicative congruences mod \(2^{12}\) 2 12 for George Andrews’s partition function, \(\overline{\mathcal{E}\mathcal{O}}(n)\) E O ¯ ( n ) , the number of partitions of n in which every even part is less than each odd part and only the largest even part occurs an odd number of times. We find analogous congruences for more general infinite products. These congruences, inspired by Atkin’s multiplicative congruences for the partition function, are obtained using Fricke involutions and Newman’s approach to half integer weight Hecke operators on eta quotients.