arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.5574math.NT
收藏

Computing Borcherds Products

Dominic Gehre, Judith Kreuzer, Martin Raum

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑