Machine-Learning the Sato--Tate Conjecture

We survey some recent applications of machine learning to problems in geometry and theoretical physics. Pure mathematical data has been compiled over the last few decades by the community and experiments in supervised, semi-supervised and unsupervised machine learning have found surprising success. We thus advocate the programme of machine learning mathematical structures, and formulating conjectures via pattern recognition, in other words using artificial intelligence to hel...

We apply transformer models and feedforward neural networks to predict Frobenius traces $a_p$ from elliptic curves given other traces $a_q$. We train further models to predict $a_p \bmod 2$ from $a_q \bmod 2$, and cross-analysis such as $a_p \bmod 2$ from $a_q$. Our experiments reveal that these models achieve high accuracy, even in the absence of explicit number-theoretic tools like functional equations of $L$-functions. We also present partial interpretability findings.

Science consists on conceiving hypotheses, confronting them with empirical evidence, and keeping only hypotheses which have not yet been falsified. Under deductive reasoning they are conceived in view of a theory and confronted with empirical evidence in an attempt to falsify it, and under inductive reasoning they are conceived based on observation, confronted with empirical evidence and a theory is established based on the not falsified hypotheses. When the hypotheses testin...

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 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...

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...

In this manuscript, we demonstrate, by using several regression techniques, that one can machine learn the other independent Hodge numbers of complete intersection Calabi-Yau four-folds and five-folds in terms of $h^{1,1}$ and $h^{2,1}$. Consequently, we combine the Hodge numbers $h^{1,1}$ and $h^{2,1}$ from the complete intersection of Calabi-Yau three-folds, four-folds, and five-folds into a single dataset. We then implemented various classification algorithms on this datas...

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.