Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On the number of even values of an eta-quotient

    https://doi.org/10.1142/S1793042123501105Cited by:0 (Source: Crossref)

    The goal of this note is to provide a general lower bound on the number of even values of the Fourier coefficients of an arbitrary eta-quotient F, over any arithmetic progression. Namely, if ga,b(x) denotes the number of even coefficients of F in degrees nb (mod a) such that nx, then we show that ga,b(x)/x is unbounded for x large.

    Note that our result is very close to the best bound currently known even in the special case of the partition function p(n) (namely, xloglogx, proven by Bellaïche and Nicolas in 2016). Our argument substantially relies upon, and generalizes, Serre’s classical theorem on the number of even values of p(n), combined with a recent modular-form result by Cotron et al. on the lacunarity modulo 2 of certain eta-quotients.

    Interestingly, even in the case of p(n) first shown by Serre, no elementary proof is known of this bound. At the end, we propose an elegant problem on quadratic representations, whose solution would finally yield a modular form-free proof of Serre’s theorem.

    AMSC: 11P83, 05A17, 11P82, 11F33