Machine-Learning the Sato--Tate Conjecture

We determine the Sato-Tate groups and prove the generalized Sato-Tate conjecture for the Jacobians of curves of the form $$ y^2=x^p-1 \text{ and } y^2=x^{2p}-1,$$ where $p$ is an odd prime. Our results rely on the fact the Jacobians of these curves are nondegenerate, a fact that we prove in the paper. Furthermore, we compute moment statistics associated to the Sato-Tate groups. These moment statistics can be used to verify the equidistribution statement of the generalized Sat...

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis on polycyclic and metabelian groups that are of interest to non-commutative cryptography. As a prototypical example, we utilize supervised learning methods to construct classifiers that can solve the conjugacy decision problem, i.e., deter...

We apply machine learning techniques to solve a specific classification problem in 4D F-theory. For a divisor $D$ on a given complex threefold base, we want to read out the non-Higgsable gauge group on it using local geometric information near $D$. The input features are the triple intersection numbers among divisors near $D$ and the output label is the non-Higgsable gauge group. We use decision tree to solve this problem and achieved 85%-98% out-of-sample accuracies for diff...

We make explicit a construction of Serre giving a definition of an algebraic Sato-Tate group associated to an abelian variety over a number field, which is conjecturally linked to the distribution of normalized L-factors as in the usual Sato-Tate conjecture for elliptic curves. The connected part of the algebraic Sato-Tate group is closely related to the Mumford-Tate group, but the group of components carries additional arithmetic information. We then check that in many cases...

In this paper we describe a deep learning--based probabilistic algorithm for integer factorisation. We use Lawrence's extension of Fermat's factorisation algorithm to reduce the integer factorisation problem to a binary classification problem. To address the classification problem, based on the ease of generating large pseudo--random primes, a corpus of training data, as large as needed, is synthetically generated. We will introduce the algorithm, summarise some experiments, ...

We implement and interpret various supervised learning experiments involving real quadratic fields with class numbers 1, 2 and 3. We quantify the relative difficulties in separating class numbers of matching/different parity from a data-scientific perspective, apply the methodology of feature analysis and principal component analysis, and use symbolic classification to develop machine-learned formulas for class numbers 1, 2 and 3 that apply to our dataset.

Determining the rank of an elliptic curve E/Q is a hard problem, and in some applications (e.g. when searching for curves of high rank) one has to rely on heuristics aimed at estimating the analytic rank (which is equal to the rank under the Birch and Swinnerton-Dyer conjecture). In this paper, we develop rank classification heuristics modeled by deep convolutional neural networks (CNN). Similarly to widely used Mestre-Nagao sums, it takes as an input the conductor of E and...

In this article, we propose to use the character theory of compact Lie groups and their orthogonality relations for the study of Frobenius distribution and Sato-Tate groups. The results show the advantages of this new approach in several aspects. With samples of Frobenius ranging in size much smaller than the moment statistic approach, we obtain very good approximation to the expected values of these orthogonality relations, which give useful information about the underlying ...

We employ techniques of machine-learning, exemplified by support vector machines and neural classifiers, to initiate the study of whether AI can "learn" algebraic structures. Using finite groups and finite rings as a concrete playground, we find that questions such as identification of simple groups by "looking" at the Cayley table or correctly matching addition and multiplication tables for finite rings can, at least for structures of small size, be performed by the AI, even...

These are my notes for a talk at the The Tate Conjecture workshop at the American Institute of Mathematics in Palo Alto, CA, July 23--July 27, 2007, somewhat revised and expanded. The intent of the talk was to review what is known and to suggest directions for research. v2: Revised expanded (24 pages).