Hostname: page-component-5d84bcc8dc-8h5rb Total loading time: 0 Render date: 2026-08-13T21:54:28.757Z Has data issue: false hasContentIssue false

Computing Borcherds products

Published online by Cambridge University Press:  01 August 2013

Dominic Gehre
Affiliation:
Lehrstuhl A für Mathematik,RWTH Aachen University,Templergraben 55, D-52056 Aachen,Germany email dominic.gehre@matha.rwth-aachen.de judith.kreuzer@matha.rwth-aachen.de
Judith Kreuzer
Affiliation:
Lehrstuhl A für Mathematik,RWTH Aachen University,Templergraben 55, D-52056 Aachen,Germany email dominic.gehre@matha.rwth-aachen.de judith.kreuzer@matha.rwth-aachen.de
Martin Raum
Affiliation:
ETH Mathematics Department,Rämistraße 101, CH-8092, Zürich,Switzerland email martin.raum@math.ethz.ch

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
© The Author(s) 2013