Algorithms for Mumford curves (Q480693)

Let \(K\) be a complete algebraically closed field with respect to a nontrivial non-archimedean valuation. A free, discrete, and finitely generated subgroup \(\Gamma\) of \(\mathrm{PGL}(2,K)\) is called Schottky; in this case, we let \(\Sigma=\Sigma(\Gamma)\) be the points of \({\mathbb P}^1(K)\) which are fixed by elements of \(\Gamma\). A \textit{Mumford curve} is the quotient variety \(C=C(\Gamma):=\Omega/\Gamma\) where \(\Omega=\Omega(\Gamma):={\mathbb P}^1(K)\setminus \Sigma\) and the genus \(g\) of \(C\) is the number of generators of \(\Gamma\); cf. \textit{D. Mumford} [Compos. Math. 24, 129--174 (1972; Zbl 0228.14011)]. Such objects are of capital importance in Berkovich theory and tropical geometry. Abelian varieties over non-archimidean fields were also considered by \textit{D. Mumford} himself [Matematika, Moskva 17, No. 4, 43--73 (1973; Zbl 0282.14013)]. In the paper under review the authors consider Mumford curves over \(K\), the complete algebraic closure of the \(p\)-adic numbers \(\mathbb Q_p\). They are concern in finding algorithms over \(\mathbb Q_p\) for the following problems (notation as above): For a given Schottky group \(\Gamma\): (1) Find a period matrix for the Jacobian of \(C\); (2) Find points in a canonical embedding of \(C\) into \(\mathbb P^{g-1}\); (3) Find a triple \((G,\ell,h)\), where \(G\) is a graph, \(\ell\) is a length function such that the metric graph \((G,\ell)\) is the abstract tropical curve which is a skeleton of the analytification of \(C\), and \(h\) is a natural equivalence between \(G\) and the rose graph on \(g\) petals. For a genus 2 curve problem (1) was already considered in [\textit{J. Teitelbaum}, J. Reine Angew. Math. 385, 117--151 (1988; Zbl 0636.14011)] The crucial step in the construction of the algorithms is the existence of an special set of generators for \(\Gamma\), which is theoretically guaranteed by \textit{L. Gerritzen} and \textit{M. van der Put} [Schottky groups and Mumford curves. Lecture Notes in Mathematics. 817. Berlin-Heidelberg-York: Springer-Verlag (1980; Zbl 0442.14009)]. In fact Morrison and Ren also manage to obtain such generators via an algorithm. Finally they discuss some reverse algorithms with respect to (1), (2) and (3) above and also consider the case of Whittaker groups which are the Schottky groups that give rise to hyperelliptic curves.