A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Computing Borcherds products
2013
LMS Journal of Computation and Mathematics
Preserved Fulltext
Other Versions
AbstractWe 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.
doi:10.1112/s1461157013000156
fatcat:gvzleloafzh2fkolgns2otogca