Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 136 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 189 tok/s Pro
GPT OSS 120B 427 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Primes represented by incomplete norm forms (1507.05080v2)

Published 17 Jul 2015 in math.NT

Abstract: Let $K=\mathbb{Q}(\omega)$ with $\omega$ the root of a degree $n$ monic irreducible polynomial $f\in\mathbb{Z}[X]$. We show the degree $n$ polynomial $N(\sum_{i=1}{n-k}x_i\omega{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\ge 4k$. In the special case $K=\mathbb{Q}(\sqrt[n]{\theta})$, we show $N(\sum_{i=1}{n-k}x_i\sqrt[n]{\theta{i-1}})$ takes infinitely many prime values provided $n\ge 22k/7$. Our proof relies on using suitable Type I' andType 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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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