2000 character limit reached
Efficient computation of non-archimedean theta functions (2408.14918v1)
Published 27 Aug 2024 in math.AG, math.GR, and math.NT
Abstract: We describe an efficient iterative algorithm for the computation of theta functions of non-archimedean Schottky groups and, more generally, of (non-archimedean) discontinuous groups.
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.