Uniform separation of small sums of roots of unity
For every fixed and every , does there exist such that, for every prime and every pairwise distinct , one has
References
Source: arXiv
Progress summary
A new preprint reports partial progress on separating nonzero sums of roots of unity, but the strongest bound remains conditional and the claims are unverified.
The problem seeks uniform lower bounds for nonzero sums of roots of unity. No proposer or original date is identified in the retrieved sources.
Known results
- Barber obtained an upper bound of for five-term sums; the bound improves to infinitely often.
- For general , nearby work gives ; when , it gives .
- Myerson is credited with earlier work on the minimum nonzero magnitude of sums of roots of unity.
October 2026 claimed progress
Qi Cheng's preprint claims a polylogarithmic exceptional-set estimate for symmetric five-term sums and a conditional subexponential lower bound for sums of prime-order roots of unity under the number-field conjecture. This is a substantive advance if correct, but no independent mathematical assessment was found.
Current status (as of October 2026): The classical quantitative results are established, while Cheng's new exceptional-set and conditional-separation claims remain unverified and the general uniform-separation problem remains open.
Solutions 0
No solutions have been posted yet.