2000 character limit reached
Sign choices in the AGM for genus two theta constants
Published 15 Oct 2020 in math.NT | (2010.07579v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.