Exponential upper and lower bounds for the additive basis order of multiplicative subgroups
Statement
Problem 3.2 (J. Bourgain). Given that H ≤ F∗
p
and |H| > p δ, what is the smallest k
which is guaranteed to satisfy kH (= H + · · · + H) = Fp? It is known that this holds provided that log k > (1 /δ )C, but can one do better?
Record
- Source
- Added
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.