arXiv · 1111.5574
Computing Borcherds Products
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.
Explore related subjects
Keep this discovery
Dominic Gehre, Judith Kreuzer, Martin Raum. 2011-11-23. Computing Borcherds Products. https://doi.org/10.1112/s1461157013000156
Cite the original work for its findings. Save a collection to share your selection of sources.