Counting lattice points to get results on prime density?
$begingroup$
Given a positive integer $n$, the number of non-negative integer solutions to the equation $x^2+y^2=n$ depends only on the prime factorization of $n$. In particular, only divisors which are congruent to $1pmod 4$ will increase the number of solutions. This is because these are the primes splitting in $mathbb{Q}(i)/mathbb{Q}$ and the norm map sends $x+iy$ to $x^2+y^2$. So we can read all of this information off of the coefficients of the corresponding Dedekind zeta function.
Gauss's circle problem instead asks for the number of lattice points inside a circle of radius $n$ centered at the origin, so this is just summing the first $n$ coefficients of the zeta function (and multiplying by 4 to allow negative numbers. Probably I should be more careful about 0, but we're at least very close). Of course we have a decent approximation for the answer to this problem, there should be about $pi n^2$ lattice points in the circle.
Side question 1) This implies that the average coefficient of the zeta function for $mathbb{Q}(i)$ is $pi/4$. Do we expect the average coefficient of general zeta functions/L functions to have some nice interpretation?
Side question 2) It seems like it should be somewhat annoying but not too hard to combine these two paragraphs to show that there are infinitely many primes $1pmod 4$ and even to get a decent approximation of the number of such primes less than a given $N$. I know the usual proof of Dirichlet's theorem and realize this isn't so different, but it seems like the lattice counting point of view should give a different approach.
Main question) How much does the above generalize? Ie, for which polynomials $f(x_1,...,x_k)$ does counting lattice points inside $f(x_1,...,x_k)=n$ as $n$ varies give information about the densities of certain primes? Conversely, which sets of prime numbers are counted by some polynomial, and does this lead to more regular behavior of these primes than we might expect?
I have a few guesses about this but nothing very solid. I'd guess that polynomials arising from norm maps of number fields would tell you about the splitting of primes in that number field, so abelian extensions of $mathbb{Q}$ would tell you about primes in specific arithmetic progressions (or sums of arithmetic progressions). I've read the book Primes of the Form $x^2+ny^2$, so I have some idea that if the class number is greater than 1 things will get hairy, but I still hope there are some results for such fields - maybe looking at multiple polynomials at once to cover different genera?
number-theory prime-numbers zeta-functions class-field-theory
edited Dec 17 '18 at 12:20
Klangen
1,75811334
asked Feb 8 '17 at 3:26
JessJess
712
$endgroup$
add a comment |
$begingroup$
Given a positive integer $n$, the number of non-negative integer solutions to the equation $x^2+y^2=n$ depends only on the prime factorization of $n$. In particular, only divisors which are congruent to $1pmod 4$ will increase the number of solutions. This is because these are the primes splitting in $mathbb{Q}(i)/mathbb{Q}$ and the norm map sends $x+iy$ to $x^2+y^2$. So we can read all of this information off of the coefficients of the corresponding Dedekind zeta function.
Gauss's circle problem instead asks for the number of lattice points inside a circle of radius $n$ centered at the origin, so this is just summing the first $n$ coefficients of the zeta function (and multiplying by 4 to allow negative numbers. Probably I should be more careful about 0, but we're at least very close). Of course we have a decent approximation for the answer to this problem, there should be about $pi n^2$ lattice points in the circle.
Side question 1) This implies that the average coefficient of the zeta function for $mathbb{Q}(i)$ is $pi/4$. Do we expect the average coefficient of general zeta functions/L functions to have some nice interpretation?
Side question 2) It seems like it should be somewhat annoying but not too hard to combine these two paragraphs to show that there are infinitely many primes $1pmod 4$ and even to get a decent approximation of the number of such primes less than a given $N$. I know the usual proof of Dirichlet's theorem and realize this isn't so different, but it seems like the lattice counting point of view should give a different approach.
Main question) How much does the above generalize? Ie, for which polynomials $f(x_1,...,x_k)$ does counting lattice points inside $f(x_1,...,x_k)=n$ as $n$ varies give information about the densities of certain primes? Conversely, which sets of prime numbers are counted by some polynomial, and does this lead to more regular behavior of these primes than we might expect?
I have a few guesses about this but nothing very solid. I'd guess that polynomials arising from norm maps of number fields would tell you about the splitting of primes in that number field, so abelian extensions of $mathbb{Q}$ would tell you about primes in specific arithmetic progressions (or sums of arithmetic progressions). I've read the book Primes of the Form $x^2+ny^2$, so I have some idea that if the class number is greater than 1 things will get hairy, but I still hope there are some results for such fields - maybe looking at multiple polynomials at once to cover different genera?
number-theory prime-numbers zeta-functions class-field-theory
edited Dec 17 '18 at 12:20
Klangen
1,75811334
asked Feb 8 '17 at 3:26
JessJess
712
$endgroup$
$begingroup$
It is only binary forms that do this.
$endgroup$
– Will Jagy
Feb 8 '17 at 4:30
$begingroup$
Why is this? Frankly, I find it amazing that this ever happens, so maybe the real question is "what is the underlying nice property of quadratic forms that makes this happen"? Right now this still feels like magic, even though I understand all the steps.
$endgroup$
– Jess
Feb 8 '17 at 5:06
$begingroup$
For making rigorous what you said about primes $bmod 4$ increasing $a_n = # { (a,b), a^2+b^2=n^2}$, I'd say you'll need to look at the splitting of primes in $mathbb{Z}[i]$ i.e. that $zeta_{mathbb{Q}(i)}(s) = frac{1}{4}sum_{(a,b) in mathbb{Z}^2 - (0,0)} |a^2+b^2|^{-s}=zeta(s) L(s,chi_4)$. And I'm not convinced you can get a decent estimation for $sum_{p equiv 1 bmod 4} 1$ without studying in detials those two L-functions
$endgroup$
– reuns
Feb 8 '17 at 9:43
1
$begingroup$
The question mixes together things that don't go together in any brief manner; suggest the book Geometry of Numbers by Lekkerkerker and Gruber for information on norm forms. The thing about binary quadratic forms, at least the principal one, is multiplication of values, on this site Brahmagupta's identity, more generally Gauss composition.
$endgroup$
– Will Jagy
Feb 8 '17 at 18:06
add a comment |
$begingroup$
Given a positive integer $n$, the number of non-negative integer solutions to the equation $x^2+y^2=n$ depends only on the prime factorization of $n$. In particular, only divisors which are congruent to $1pmod 4$ will increase the number of solutions. This is because these are the primes splitting in $mathbb{Q}(i)/mathbb{Q}$ and the norm map sends $x+iy$ to $x^2+y^2$. So we can read all of this information off of the coefficients of the corresponding Dedekind zeta function.
Gauss's circle problem instead asks for the number of lattice points inside a circle of radius $n$ centered at the origin, so this is just summing the first $n$ coefficients of the zeta function (and multiplying by 4 to allow negative numbers. Probably I should be more careful about 0, but we're at least very close). Of course we have a decent approximation for the answer to this problem, there should be about $pi n^2$ lattice points in the circle.
Side question 1) This implies that the average coefficient of the zeta function for $mathbb{Q}(i)$ is $pi/4$. Do we expect the average coefficient of general zeta functions/L functions to have some nice interpretation?
Side question 2) It seems like it should be somewhat annoying but not too hard to combine these two paragraphs to show that there are infinitely many primes $1pmod 4$ and even to get a decent approximation of the number of such primes less than a given $N$. I know the usual proof of Dirichlet's theorem and realize this isn't so different, but it seems like the lattice counting point of view should give a different approach.
Main question) How much does the above generalize? Ie, for which polynomials $f(x_1,...,x_k)$ does counting lattice points inside $f(x_1,...,x_k)=n$ as $n$ varies give information about the densities of certain primes? Conversely, which sets of prime numbers are counted by some polynomial, and does this lead to more regular behavior of these primes than we might expect?
I have a few guesses about this but nothing very solid. I'd guess that polynomials arising from norm maps of number fields would tell you about the splitting of primes in that number field, so abelian extensions of $mathbb{Q}$ would tell you about primes in specific arithmetic progressions (or sums of arithmetic progressions). I've read the book Primes of the Form $x^2+ny^2$, so I have some idea that if the class number is greater than 1 things will get hairy, but I still hope there are some results for such fields - maybe looking at multiple polynomials at once to cover different genera?
number-theory prime-numbers zeta-functions class-field-theory
edited Dec 17 '18 at 12:20
Klangen
1,75811334
asked Feb 8 '17 at 3:26
JessJess
712
$endgroup$
Given a positive integer $n$, the number of non-negative integer solutions to the equation $x^2+y^2=n$ depends only on the prime factorization of $n$. In particular, only divisors which are congruent to $1pmod 4$ will increase the number of solutions. This is because these are the primes splitting in $mathbb{Q}(i)/mathbb{Q}$ and the norm map sends $x+iy$ to $x^2+y^2$. So we can read all of this information off of the coefficients of the corresponding Dedekind zeta function.
Gauss's circle problem instead asks for the number of lattice points inside a circle of radius $n$ centered at the origin, so this is just summing the first $n$ coefficients of the zeta function (and multiplying by 4 to allow negative numbers. Probably I should be more careful about 0, but we're at least very close). Of course we have a decent approximation for the answer to this problem, there should be about $pi n^2$ lattice points in the circle.
Side question 1) This implies that the average coefficient of the zeta function for $mathbb{Q}(i)$ is $pi/4$. Do we expect the average coefficient of general zeta functions/L functions to have some nice interpretation?
Side question 2) It seems like it should be somewhat annoying but not too hard to combine these two paragraphs to show that there are infinitely many primes $1pmod 4$ and even to get a decent approximation of the number of such primes less than a given $N$. I know the usual proof of Dirichlet's theorem and realize this isn't so different, but it seems like the lattice counting point of view should give a different approach.
Main question) How much does the above generalize? Ie, for which polynomials $f(x_1,...,x_k)$ does counting lattice points inside $f(x_1,...,x_k)=n$ as $n$ varies give information about the densities of certain primes? Conversely, which sets of prime numbers are counted by some polynomial, and does this lead to more regular behavior of these primes than we might expect?
I have a few guesses about this but nothing very solid. I'd guess that polynomials arising from norm maps of number fields would tell you about the splitting of primes in that number field, so abelian extensions of $mathbb{Q}$ would tell you about primes in specific arithmetic progressions (or sums of arithmetic progressions). I've read the book Primes of the Form $x^2+ny^2$, so I have some idea that if the class number is greater than 1 things will get hairy, but I still hope there are some results for such fields - maybe looking at multiple polynomials at once to cover different genera?
number-theory prime-numbers zeta-functions class-field-theory
number-theory prime-numbers zeta-functions class-field-theory
edited Dec 17 '18 at 12:20
Klangen
1,75811334
asked Feb 8 '17 at 3:26
JessJess
712
edited Dec 17 '18 at 12:20
Klangen
1,75811334
asked Feb 8 '17 at 3:26
JessJess
712
edited Dec 17 '18 at 12:20
Klangen
1,75811334
edited Dec 17 '18 at 12:20
Klangen
1,75811334
edited Dec 17 '18 at 12:20
Klangen
1,75811334
1,75811334
asked Feb 8 '17 at 3:26
JessJess
712
asked Feb 8 '17 at 3:26
JessJess
712
asked Feb 8 '17 at 3:26
JessJess
712
712
$begingroup$
It is only binary forms that do this.
$endgroup$
– Will Jagy
Feb 8 '17 at 4:30
$begingroup$
Why is this? Frankly, I find it amazing that this ever happens, so maybe the real question is "what is the underlying nice property of quadratic forms that makes this happen"? Right now this still feels like magic, even though I understand all the steps.
$endgroup$
– Jess
Feb 8 '17 at 5:06
$begingroup$
For making rigorous what you said about primes $bmod 4$ increasing $a_n = # { (a,b), a^2+b^2=n^2}$, I'd say you'll need to look at the splitting of primes in $mathbb{Z}[i]$ i.e. that $zeta_{mathbb{Q}(i)}(s) = frac{1}{4}sum_{(a,b) in mathbb{Z}^2 - (0,0)} |a^2+b^2|^{-s}=zeta(s) L(s,chi_4)$. And I'm not convinced you can get a decent estimation for $sum_{p equiv 1 bmod 4} 1$ without studying in detials those two L-functions
$endgroup$
– reuns
Feb 8 '17 at 9:43
1
$begingroup$
The question mixes together things that don't go together in any brief manner; suggest the book Geometry of Numbers by Lekkerkerker and Gruber for information on norm forms. The thing about binary quadratic forms, at least the principal one, is multiplication of values, on this site Brahmagupta's identity, more generally Gauss composition.
$endgroup$
– Will Jagy
Feb 8 '17 at 18:06
add a comment |
$begingroup$
It is only binary forms that do this.
$endgroup$
– Will Jagy
Feb 8 '17 at 4:30
$begingroup$
Why is this? Frankly, I find it amazing that this ever happens, so maybe the real question is "what is the underlying nice property of quadratic forms that makes this happen"? Right now this still feels like magic, even though I understand all the steps.
$endgroup$
– Jess
Feb 8 '17 at 5:06
$begingroup$
For making rigorous what you said about primes $bmod 4$ increasing $a_n = # { (a,b), a^2+b^2=n^2}$, I'd say you'll need to look at the splitting of primes in $mathbb{Z}[i]$ i.e. that $zeta_{mathbb{Q}(i)}(s) = frac{1}{4}sum_{(a,b) in mathbb{Z}^2 - (0,0)} |a^2+b^2|^{-s}=zeta(s) L(s,chi_4)$. And I'm not convinced you can get a decent estimation for $sum_{p equiv 1 bmod 4} 1$ without studying in detials those two L-functions
$endgroup$
– reuns
Feb 8 '17 at 9:43
1
$begingroup$
The question mixes together things that don't go together in any brief manner; suggest the book Geometry of Numbers by Lekkerkerker and Gruber for information on norm forms. The thing about binary quadratic forms, at least the principal one, is multiplication of values, on this site Brahmagupta's identity, more generally Gauss composition.
$endgroup$
– Will Jagy
Feb 8 '17 at 18:06
$begingroup$
It is only binary forms that do this.
$endgroup$
– Will Jagy
Feb 8 '17 at 4:30
$begingroup$
It is only binary forms that do this.
$endgroup$
– Will Jagy
Feb 8 '17 at 4:30
$begingroup$
Why is this? Frankly, I find it amazing that this ever happens, so maybe the real question is "what is the underlying nice property of quadratic forms that makes this happen"? Right now this still feels like magic, even though I understand all the steps.
$endgroup$
– Jess
Feb 8 '17 at 5:06
$begingroup$
Why is this? Frankly, I find it amazing that this ever happens, so maybe the real question is "what is the underlying nice property of quadratic forms that makes this happen"? Right now this still feels like magic, even though I understand all the steps.
$endgroup$
– Jess
Feb 8 '17 at 5:06
$begingroup$
For making rigorous what you said about primes $bmod 4$ increasing $a_n = # { (a,b), a^2+b^2=n^2}$, I'd say you'll need to look at the splitting of primes in $mathbb{Z}[i]$ i.e. that $zeta_{mathbb{Q}(i)}(s) = frac{1}{4}sum_{(a,b) in mathbb{Z}^2 - (0,0)} |a^2+b^2|^{-s}=zeta(s) L(s,chi_4)$. And I'm not convinced you can get a decent estimation for $sum_{p equiv 1 bmod 4} 1$ without studying in detials those two L-functions
$endgroup$
– reuns
Feb 8 '17 at 9:43
$begingroup$
For making rigorous what you said about primes $bmod 4$ increasing $a_n = # { (a,b), a^2+b^2=n^2}$, I'd say you'll need to look at the splitting of primes in $mathbb{Z}[i]$ i.e. that $zeta_{mathbb{Q}(i)}(s) = frac{1}{4}sum_{(a,b) in mathbb{Z}^2 - (0,0)} |a^2+b^2|^{-s}=zeta(s) L(s,chi_4)$. And I'm not convinced you can get a decent estimation for $sum_{p equiv 1 bmod 4} 1$ without studying in detials those two L-functions
$endgroup$
– reuns
Feb 8 '17 at 9:43
1
1
$begingroup$
The question mixes together things that don't go together in any brief manner; suggest the book Geometry of Numbers by Lekkerkerker and Gruber for information on norm forms. The thing about binary quadratic forms, at least the principal one, is multiplication of values, on this site Brahmagupta's identity, more generally Gauss composition.
$endgroup$
– Will Jagy
Feb 8 '17 at 18:06
$begingroup$
The question mixes together things that don't go together in any brief manner; suggest the book Geometry of Numbers by Lekkerkerker and Gruber for information on norm forms. The thing about binary quadratic forms, at least the principal one, is multiplication of values, on this site Brahmagupta's identity, more generally Gauss composition.
$endgroup$
– Will Jagy
Feb 8 '17 at 18:06
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2134358%2fcounting-lattice-points-to-get-results-on-prime-density%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2134358%2fcounting-lattice-points-to-get-results-on-prime-density%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
It is only binary forms that do this.
$endgroup$
– Will Jagy
Feb 8 '17 at 4:30
$begingroup$
Why is this? Frankly, I find it amazing that this ever happens, so maybe the real question is "what is the underlying nice property of quadratic forms that makes this happen"? Right now this still feels like magic, even though I understand all the steps.
$endgroup$
– Jess
Feb 8 '17 at 5:06
$begingroup$
For making rigorous what you said about primes $bmod 4$ increasing $a_n = # { (a,b), a^2+b^2=n^2}$, I'd say you'll need to look at the splitting of primes in $mathbb{Z}[i]$ i.e. that $zeta_{mathbb{Q}(i)}(s) = frac{1}{4}sum_{(a,b) in mathbb{Z}^2 - (0,0)} |a^2+b^2|^{-s}=zeta(s) L(s,chi_4)$. And I'm not convinced you can get a decent estimation for $sum_{p equiv 1 bmod 4} 1$ without studying in detials those two L-functions
$endgroup$
– reuns
Feb 8 '17 at 9:43
1
$begingroup$
The question mixes together things that don't go together in any brief manner; suggest the book Geometry of Numbers by Lekkerkerker and Gruber for information on norm forms. The thing about binary quadratic forms, at least the principal one, is multiplication of values, on this site Brahmagupta's identity, more generally Gauss composition.
$endgroup$
– Will Jagy
Feb 8 '17 at 18:06