Polylogarithmic root bound for sparse trinomials over finite fields
Statement
Let be prime, let satisfy and , and consider the trinomial
Polylogarithmic root-bound conjecture. There is an absolute constant such that this trinomial has no more than roots in .
This conjecture proposes an upper bound for the number of roots of normalized trinomials over prime finite fields, in contrast with the experimentally motivated possibility of trinomials having on the order of roots. Its status is not resolved by the supplied source context.
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.