Irreducibility of a holomorphic eta quotient is determinable

Abstract

We show that a holomorphic eta quotient has only finitely many factors. We also provide an algorithm for checking irreducibility of holomorphic eta quotients by constructing an upper bound for the minimum of the levels of the proper factors of a reducible holomorphic eta quotient.

There are several errors in the paper: In Section 2, the statements of Theorem 2, Corollary 7 and Lemma 2 are not entirely correct. In Section 6, there are mistakes in the proof of Lemma 7

References in corpus (2)

• Quantum Black Holes, Wall Crossing, and Mock Modular Forms
• Generating spaces of modular forms with $\eta$-quotients

Cited by in corpus (1)

• Infinite Families of Simple Holomorphic Eta Quotients