A polynomial analogue of the twin prime conjecture

DOI10.1090/S0002-9939-08-09351-9zbMath1155.11058WikidataQ122922660 ScholiaQ122922660MaRDI QIDQ3532501

Paul Pollack

Publication date: 28 October 2008

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

finite fieldsSelberg sievetwin prime polynomials

Mathematics Subject Classification ID

Arithmetic theory of polynomial rings over finite fields (11T55) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Related Items (7)

Computers as a novel mathematical reality. IV: The Goldbach problem ⋮ THE EXCEPTIONAL SET IN THE POLYNOMIAL GOLDBACH PROBLEM ⋮ Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field ⋮ An explicit polynomial analogue of Romanoff's theorem ⋮ Correlation of arithmetic functions over \(\mathbb{F}_q[T\)] ⋮ Correlations of Sums of Two Squares and Other Arithmetic Functions in Function Fields ⋮ Romanoff's theorem for polynomials over finite fields revisited

Cites Work

• \(L\)-functions of twisted Legendre curves
• On sums of primes
• Sieve methods for polynomial rings over finite fields
• Simultaneous prime specializations of polynomials over finite fields
• A polynomial analog of the Goldbach conjecture
• The Arithmetic of Polynomials in a Galois Field
• The Distribution of Irreducibles in GF [ q,x ]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial analogue of the twin prime conjecture