On sets defining few ordinary lines

What's new

Ben Green and I have just uploaded to the arXiv our new paper “On sets defining few ordinary lines“, submitted to Discrete and Computational Geometry. This paper asymptotically solves two old questions concerning finite configurations of points $latex {P}&fg=000000$ in the plane $latex {{mathbb R}^2}&fg=000000$. Given a set $latex {P}&fg=000000$ of $latex {n}&fg=000000$ points in the plane, define an ordinary line to be a line containing exactly two points of $latex {P}&fg=000000$. The classical Sylvester-Gallai theorem, first posed as a problem by Sylvester in 1893, asserts that as long as the points of $latex {P}&fg=000000$ are not all collinear, $latex {P}&fg=000000$ defines at least one ordinary line:

It is then natural to pose the question of what is the minimal number of ordinary lines that a set of $latex {n}&fg=000000$ non-collinear points can generate. In 1940, Melchior gave an elegant proof of the Sylvester-Gallai theorem based…

View original post 4,423 more words


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s