Efficient computation of non-archimedean theta functions

Publication date

2025-02-12



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.

Document Type

Article

Document version

Accepted version

Language

English

Pages

16 p.

Publisher

American Mathematical Society

Published in

Mathematics of Computation

Recommended citation

This citation was generated automatically.

Documents

Efficient computation of non-archimedean theta functions.pdf

590.5Kb

 

Rights

Attribution 4.0 International

Attribution 4.0 International

This item appears in the following Collection(s)

CRM Articles [713]