English

Cubic twin prime polynomials are counted by a modular form

Number Theory 2019-11-13 v2

Abstract

We present the geometry lying behind counting twin prime polynomials in Fq[T]\mathbb{F}_q[T] in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties for cubic twin prime polynomials. The elliptic curve X3=Y(Y1)X^3 = Y(Y-1) occurs in the geometry, and thus counting cubic twin prime polynomials involves the associated modular form. In theory, this approach can be extended to higher degree twin primes, but the computations become harder. The formula we get in degree 33 is compatible with the Hardy-Littlewood heuristic on average, agrees with the prediction for q2(mod3)q \equiv 2 \pmod 3 but shows anomalies for q1(mod3)q \equiv 1 \pmod 3.

Keywords

Cite

@article{arxiv.1711.05564,
  title  = {Cubic twin prime polynomials are counted by a modular form},
  author = {Lior Bary-Soroker and Jakob Stix},
  journal= {arXiv preprint arXiv:1711.05564},
  year   = {2019}
}

Comments

minor changes

R2 v1 2026-06-22T22:46:47.844Z