Computing Borcherds Products
arXiv:1111.5574 · doi:10.1112/S1461157013000156
Abstract
We present an algorithm for computing Borcherds products, which has polynomial runtime. It deals efficiently with the bounds on Fourier expansion indices originating in Weyl chambers. Naive multiplication has exponential runtime due to inefficient handling of these bounds. An implementation of the new algorithm shows that it is also much faster in practice.
arXiv comment18 pages
References in corpus (9)
- Automorphic forms with singularities on Grassmannians
- Quantum Black Holes, Wall Crossing, and Mock Modular Forms
- On the algebras of BPS states
- Dyon Spectrum in CHL Models
- Spectrum of CHL Dyons from Genus-Two Partition Function
- The Siegel modular forms of genus 2 with the simplest divisor
- Paramodular Cusp Forms
- Product formulas for modular forms on O(2,n) (after R.Borcherds)
- BKM Lie superalgebra for the Z_5 orbifolded CHL string