Cubic twin prime polynomials are counted by a modular form
Abstract
We present the geometry lying behind counting twin prime polynomials in Fq[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(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 3 is compatible with the Hardy-Littlewood heuristic on average, agrees with the prediction for q 2 3 but shows anomalies for q 1 3.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.