Papers › Elliptic curves with missing Frobenius traces
Elliptic curves with missing Frobenius traces
Nathan Jones, Kevin Vissuet
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Let E be an elliptic curve defined over ℚ. In 1976, Lang and Trotter conjectured an asymptotic formula for the number π_(E,r)(X) of primes p ≤X of good reduction for which the Frobenius trace at p associated to E is equal to a given fixed integer r. We investigate elliptic curves E over ℚ that have a missing Frobenius trace, i.e. for which the counting function π_(E,r)(X) remains bounded as X →∞, for some r ∈ℤ. In particular, we classify all elliptic curves E over ℚ(t) that have a missing Frobenius trace.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections