2000 character limit reached
Ramanujan congruences for overpartitions with restricted odd differences
Published 5 Apr 2022 in math.NT and math.CO | (2204.02444v1)
Abstract: We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms to prove a more general theorem which bounds the number of primes possible for Ramanujan congruences in certain eta-quotients. This generalizes work done by Jonah Sinick. We also provide two congruences modulo 5 for this 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.