Polynomial lower-bound conjecture for sums of roots of unity

About 10 years old · traced to

For an integer N≥1N\ge 1, let f(n+1,N)f(n+1,N) be the least positive value of

∣1+ζ1+⋯+ζn∣\left|1+\zeta_1+\cdots+\zeta_n\right|

where ζ1N=⋯=ζnN=1\zeta_1^N=\cdots=\zeta_n^N=1.

Polynomial lower-bound conjecture. For given n≥1n\ge 1 there exist constants c(n)>0c(n)>0 and λ(n)>0\lambda(n)>0 such that

f(n+1,N)≥c(n)N−λ(n)f(n+1,N)\ge c(n)N^{-\lambda(n)}

for all N≥1N\ge 1.

Polynomial lower bounds are known in some small cases, while the general case, in particular for n≥4n\ge 4, is presented as unknown. The conjecture is described as folklore and would follow from a positive answer to a question posed by Myerson.

References

Primary source

P. Habegger, “Diophantine Approximations on Definable Sets”, arXiv:1608.04547 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.