Timeline for Heuristic lower bounds on small sums of roots of unity
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2021 at 20:26 | answer | added | Mark Lewko | timeline score: 2 | |
| Jun 14, 2021 at 17:04 | history | became hot network question | |||
| Jun 14, 2021 at 15:59 | answer | added | Terry Tao | timeline score: 19 | |
| Jun 14, 2021 at 9:04 | comment | added | Ben Barber | The upper bound is $\phi(n)^{-k/4}$, where $\phi(n) \gg n/\log\log n$ is the totient function. The current arXiv version of my paper on $f(5,n)$ has the incorrect $n^{-k/4 + o(1)}$. | |
| Jun 14, 2021 at 9:01 | history | asked | Ben Barber | CC BY-SA 4.0 |