Computing Borcherds Products
Dominic Gehre, Judith Kreuzer, Martin Raum

TL;DR
This paper introduces an efficient polynomial-time algorithm for computing Borcherds products, overcoming exponential runtime issues of naive methods by effectively managing Fourier expansion bounds, with practical implementation demonstrating significant speed improvements.
Contribution
The paper presents a novel polynomial-time algorithm for computing Borcherds products, improving efficiency over previous exponential-time approaches.
Findings
Algorithm has polynomial runtime
Implementation shows practical speedup
Handles Fourier bounds efficiently
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
