ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.