Katz–Tao discretized sum-product conjecture
Statement
For , define a -set to be a -separated subset satisfying and for every interval . Let denote the maximal cardinality of a -separated subset of . Katz–Tao discretized sum-product conjecture. There exists such that every -set satisfies
This is a discretized analogue of the Erdős–Szemerédi problem, with covering numbers replaced here by maximal separated-set cardinalities. The source attributes the question to Katz and Tao; its resolution status is not given in the supplied text.
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.