Timeline for Reference / Survey for finite field analog number theory
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2020 at 21:54 | history | became hot network question | |||
| Apr 14, 2020 at 14:31 | vote | accept | peter | ||
| Apr 14, 2020 at 14:31 | comment | added | Will Sawin | Arguably counting prime polynomials of degree $n$ is not really the right analogue of the prime number theorem. A better one might be prime polynomials with the leading $k$ coefficients fixed. This requires nonvanishing on $s=1$ for a Dirichlet $L$-function, and can be proven by the same kind of complex-analytic argument. (Or by one of the four different proofs of the Riemann hypothesis, of course - but none of them are as trivial as the "some combinatorial reasonings" you mention, which give the wrong impression IMO.) | |
| Apr 14, 2020 at 14:16 | comment | added | Watson | See also the non-analogies: mathoverflow.net/questions/177234 | |
| Apr 14, 2020 at 14:15 | answer | added | LeoOwler | timeline score: 7 | |
| Apr 14, 2020 at 14:10 | comment | added | Watson | In general, we say "function field" analogue. I don't know a good survey, but maybe concerning objects this could be a good start. See also this question: mathoverflow.net/questions/1367/…, especially this reference. | |
| Apr 14, 2020 at 13:55 | review | First posts | |||
| Apr 14, 2020 at 14:56 | |||||
| Apr 14, 2020 at 13:53 | history | asked | peter | CC BY-SA 4.0 |