arXiv 1602.030872016-02math.NT

Irreducibility of a holomorphic eta quotient is determinable

Soumya Bhattacharya

备注：: 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

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

英文摘要：

相关论文

Infinite Families of Simple Holomorphic Eta Quotients