Timeline for Prime numbers in arithmetic progressions : uniformity with respect to the modulus
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2012 at 18:06 | vote | accept | js21 | ||
| Mar 6, 2012 at 19:00 | comment | added | GH from MO | This paper is now in the arXiv: front.math.ucdavis.edu/1203.0596 | |
| Mar 3, 2012 at 19:06 | history | edited | Micah Milinovich | CC BY-SA 3.0 |
added 1 characters in body
|
| Mar 3, 2012 at 16:33 | comment | added | js21 | The proof of Siegel's theorem in this article is truly elementary (and this provides a simplification of Pintz's previous proof ; so thanks for this interesting reference). But the difficulty here is to turn the information on $L(1,\chi)$ into an estimate for $\Psi(X,q,a)$ : the author doesn't avoid this issue and makes a crucial use of Fourier inversion formula (as an ersatz of Perron's inversion formula). | |
| Mar 3, 2012 at 15:25 | history | answered | Micah Milinovich | CC BY-SA 3.0 |