Sign choices in the AGM for genus two theta constants
arXiv (Cornell University)(2022)
摘要
Existing algorithms to compute genus 2 theta constants in quasi-linear time use Borchardt sequences, an analogue of the arithmetic-geometric mean for four complex numbers. In this paper, we show that these Borchardt sequences are given by good choices of square roots only, as in the genus 1 case. This removes the sign indeterminacies in the algorithm without relying on numerical integration.
更多查看译文
关键词
agm,sign,genus
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要