Learning Euler Factors of Elliptic Curves
Not on the map. Why?
Abstract (arXiv)
We apply transformer models and feedforward neural networks to predict Frobenius traces ap from elliptic curves given other traces aq. We train further models to predict ap bmod 2 from aq bmod 2, and cross-analysis such as ap bmod 2 from aq. 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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Feb 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025From Black Box to Bijection: Interpreting Machine Learning to Build a Zeta Map Algorithmcited by 3
- 2025Int2Int: a framework for mathematics with transformerscited by 1
- 2026Transformers Learn the Mestre-Nagao Heuristiccited by 0
- 2026Decision trees, Frobenius traces, and Weierstrass coefficients of elliptic curvescited by 0
- 2026Decision trees, Frobenius traces, and Weierstrass coefficients of elliptic curves27 Jul 2026
- 2026Transformers Learn the Mestre-Nagao Heuristic13 Jun 2026
- 2025From Black Box to Bijection: Interpreting Machine Learning to Build a Zeta Map Algorithm16 Nov 2025
- 2025Int2Int: a framework for mathematics with transformers22 Feb 2025