Computing Borcherds Products
Number Theory
2019-02-20 v2
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.
Keywords
Cite
@article{arxiv.1111.5574,
title = {Computing Borcherds Products},
author = {Dominic Gehre and Judith Kreuzer and Martin Raum},
journal= {arXiv preprint arXiv:1111.5574},
year = {2019}
}
Comments
18 pages