Polynomial lower-bound conjecture for sums of roots of unity
Polynomial lower-bound conjecture for sums of roots of unity
For an integer , let be the least positive value of
where .
Polynomial lower-bound conjecture. For given there exist constants and such that
for all .
Polynomial lower bounds are known in some small cases, while the general case, in particular for , is presented as unknown. The conjecture is described as folklore and would follow from a positive answer to a question posed by Myerson.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.