2000 character limit reached
Multiplicative congruences for Andrews's even parts below odd parts function and related infinite products
Published 2 May 2025 in math.NT and math.CO | (2505.01344v1)
Abstract: We prove multiplicative congruences mod $2{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(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 are obtained using Fricke involutions and Newman's approach to half integer weight Hecke operators on eta quotients, and were inspired by Atkin's multiplicative congruences for the partition function.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.