Let with the root of a degree monic
irreducible polynomial . We show the degree polynomial
in variables formed by setting the
final coefficients to 0 takes the expected asymptotic number of prime
values if . In the special case , we
show takes infinitely many prime
values provided .
Our proof relies on using suitable Type I' and Type II’ estimates in
Harman’s sieve, which are established in a similar overall manner to the
previous work of Friedlander and Iwaniec on prime values of and of
Heath-Brown on . Our proof ultimately relies on employing explicit
elementary estimates from the geometry of numbers and algebraic geometry to
control the number of highly skewed lattices appearing in our final estimates.

生成讲解博客的中文版本

生成AI智能校验的中文版本