Timeline for Explicit estimates for $N(T,\chi)$ (not $N(T,\chi)+N(T,\overline{\chi})$)
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2021 at 1:07 | comment | added | H A Helfgott | That's also my impression. | |
| Dec 4, 2021 at 18:09 | comment | added | juan | @Helfgott I misunderstood you, I was surprised that you were unaware of this. I think the factor 2 can not be eliminated, perhaps using Kronecker's theorem we can prove this. | |
| Dec 4, 2021 at 17:49 | comment | added | H A Helfgott | The mystery is why people don't give a better bound :). | |
| Dec 4, 2021 at 17:48 | comment | added | H A Helfgott | Oh, I know how to derive that - I was just pointing out that (a) one can easily do better, (b) I don't know how to get rid of the factor of $2$ (and one most likely can't). | |
| Dec 4, 2021 at 17:44 | history | answered | juan | CC BY-SA 4.0 |