Primes represented by incomplete norm forms
Abstract
Let K=Q(ω) with ω the root of a degree n monic irreducible polynomial f∈Z[X]. We show the degree n polynomial N(Σi=1n-kxiωi-1) in n-k variables formed by setting the final k coefficients to 0 takes the expected asymptotic number of prime values if n 4k. In the special case K=Q([n]θ), we show N(Σi=1n-kxi[n]θi-1) takes infinitely many prime values provided n 22k/7. 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 X2+Y4 and of Heath-Brown on X3+2Y3. 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.
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.