Computational approach to the Schottky problem
E. Brandon de Leon, J. Frauendiener, C. Klein

TL;DR
This paper introduces a computational method using Fay's trisecant identity to identify Jacobian varieties among Riemann matrices, providing a numerical approach to the classical Schottky problem for higher genus cases.
Contribution
The paper develops a novel numerical algorithm based on Fay's identity to solve the Schottky problem, extending previous methods and comparing results with the Schottky-Igusa form.
Findings
Algorithm successfully identifies Jacobian varieties in genus 4.
Residuals from Fay's identity match those from the Schottky-Igusa form in genus 4.
Method's applicability in higher genera (5-7) is discussed with known examples.
Abstract
We present a computational approach to the classical Schottky problem based on Fay's trisecant identity for genus . For a given Riemann matrix , the Fay identity establishes linear dependence of secants in the Kummer variety if and only if the Riemann matrix corresponds to a Jacobian variety as shown by Krichever. The theta functions in terms of which these secants are expressed depend on the Abel maps of four arbitrary points on a Riemann surface. However, there is no concept of an Abel map for general . To establish linear dependence of the secants, four components of the vectors entering the theta functions can be chosen freely. The remaining components are determined by a Newton iteration to minimize the residual of the Fay identity. Krichever's theorem assures that if this residual vanishes within the finite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuasicrystal Structures and Properties · Finite Group Theory Research · Graph theory and applications
