Learning Euler Factors of Elliptic Curves
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:6HXGPTDNrecord.jsonopen to challenge →
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Computer vision and converse theorems
2D CNNs on image-encoded elliptic curve twists outperform 1D CNNs on Frobenius traces alone at separating conductor families from Sato-Tate random matrices and can predict analytic rank.
-
Large Lemma Miners: Can LLMs do Induction Proofs for Hardware?
A neurosymbolic method using two LLM prompting frameworks generates provably correct inductive arguments for 84% of a set of mid-size open-source RTL hardware designs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.