Bourgain's three-dimensional rich-line problem
Statement
Problem 3.12 (J. Bourgain). Consider the Szemer´ edi-Trotter theorem in R3 with n2
lines, each containing n points from a given set S. Assume no n lines are coplanar. Find a lower bound for S (e.g. |S| ≥ n3−≤).
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.