Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cubic twin prime polynomials are counted by a modular form

Published 15 Nov 2017 in math.NT | (1711.05564v2)

Abstract: We present the geometry lying behind counting twin prime polynomials in $\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(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 \equiv 2 \pmod 3$ but shows anomalies for $q \equiv 1 \pmod 3$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.