Polynomials and Primes in Generalized Arithmetic Progressions
From MaRDI portal
Abstract: We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The prime variant can be interpreted as a multi-dimensional, polynomial extension of Linnik's Theorem. This version is a revision of the published version. Most notably, the properness hypotheses have been removed from Theorems 2 and 3, and the numerology in Theorem 2 has been improved.
Recommendations
- Prime polynomials in short intervals and in arithmetic progressions
- Arithmetic and polynomial progressions in the primes [after Gowers, Green, Tao and Ziegler]
- Polynomial patterns in the primes
- Primes representable by polynomials and the lower bound of the least primes in arithmetic progressions
- Towards representations of primes by polynomials
- Polynomial configurations in the primes
- Primes in Sequences Associated to Polynomials (After Lehmer)
- scientific article; zbMATH DE number 1303010
- scientific article; zbMATH DE number 2145143
Cited in
(7)- Multiplicative polynomials and Fermat's little theorem for non-primes
- Primes, products and polynomials
- Polynomial products modulo primes and applications
- Multivariate polynomial values in difference sets
- A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
- Regularity of primes associated with polynomial parametrisations
- Two-dimensional arithmetic progressions avoiding squares
This page was built for publication: Polynomials and Primes in Generalized Arithmetic Progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450427)
