Efficient computation of non-archimedean theta functions

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.

Authors

Institutions

Publication Details

Journal
Mathematics of Computation
Published
2025-02-12
DOI
https://doi.org/10.1090/mcom/4066
Primary Topic
Advanced Mathematical Identities
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient computation of non-archimedean theta functions

Xavier Xarles, Marc Masdeu
Mathematics of Computation
Advanced Mathematical Identities
article

Efficient computation of non-archimedean theta functions

Xavier Xarles, Marc Masdeu
article en

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.

Mathematics of ComputationVol. 95(357)
Universitat Autònoma de Barcelona (ES), Centre de Recerca Matemàtica (ES)
Centres de Recerca de Catalunya, Ministerio de Ciencia y Tecnología, Agencia Estatal de Investigación
Openalex Percentile: Top 95%
Advanced Mathematical Identities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.