Efficient computation of non-archimedean theta functions

TL;DR

This paper introduces an efficient iterative algorithm for computing non-archimedean theta functions associated with Schottky and other discontinuous groups, enhancing computational methods in non-archimedean analysis.

Contribution

The paper presents a novel iterative algorithm specifically designed for efficient computation of non-archimedean theta functions, expanding computational tools in non-archimedean geometry.

Findings

Algorithm significantly reduces computation time

Applicable to a broad class of non-archimedean groups

Improves accuracy of non-archimedean theta function calculations

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.