Main exponential-sum conjecture for powers of 3 modulo powers of 2
Statement
Let and be constants, and for each and nonzero consider the average of the exponential sequence for , where and denotes real part.
Main exponential-sum conjecture. There are constants and such that for all and all nonzero ,
This conjecture would give a linear lower bound on the Hamming distance of the proposed deterministic tree-code construction, and hence would establish that construction as an effectively computable asymptotically good tree code. It is presented as the main conjecture of the paper; no resolution is given.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.