Closure-size conjecture for three-dimensional line-sparse sets
Statement
Let , and let be a set that meets every line at most once. Write for the closure of under the closure operation considered in the paper.
Closure-size conjecture. There are constants such that, if
then
Non-trivial lower bounds on the closure size would improve the lower bounds on ; the surrounding discussion indicates that this remains open, with only weak bounds known for higher dimensions.
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.