Almost all primes satisfy the Atkin-Serre conjecture and are not extremal
Bibliographic record
Abstract
Let $f(z)=\sum_{n=1}^{\infty} a_f(n)e^{2\pi i n z}$ be a non-CM holomorphic cupsidal newform of trivial nebentypus and even integral level $k\geq 2$. Deligne's proof of the Weil conjectures shows that $|a_f(p)|\leq 2p^{\frac{k-1}{2}}$ for all primes $p$. We prove for 100% of primes $p$ that $2p^{\frac{k-1}{2}}\frac{\log\log p}{\sqrt{\log p}}<|a_f(p)|<\lfloor 2p^{\frac{k-1}{2}}\rfloor$. Our proof gives an effective upper bound for the size of the exceptional set. The lower bound shows that the Atkin-Serre conjecture is satisfied for 100% of primes, and the upper bound shows that $|a_f(p)|$ is as large as possible (i.e., $p$ is extremal for $f$) for 0% of primes. Our proofs use the effective form of the Sato-Tate conjecture proved by the second author, which relies on the recent proof of the automorphy of the symmetric powers of $f$ due to Newton and Thorne.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".