arXiv · 1602.03087
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.
Explore related subjects
Keep this discovery
Soumya Bhattacharya. 2016-02-09. Irreducibility of a holomorphic eta quotient is determinable. https://arxiv.org/abs/1602.03087
Cite the original work for its findings. Save a collection to share your selection of sources.