Computing Borcherds products

From MaRDI portal
Publication:5169601



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.






Describes a project that uses

Uses Software






This page was built for publication: Computing Borcherds products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169601)