University of Cambridge > > Isaac Newton Institute Seminar Series > Integer distance sets

Integer distance sets

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

OOEW04 - Structure and Randomness - a celebration of the mathematics of Timothy Gowers

I’ll speak about new joint work with Rachel Greenfeld and Marina Iliopoulou in which we address some classical questions concerning the size and structure of integer distance sets. A subset of the Euclidean plane is said to be an integer distance set if the distance between any pair of points in the set is an integer. Our main result is that any integer distance set in the plane has all but a very small number of points lying on a single line or circle. From this, we deduce a near-optimal lower bound on the diameter of any non-collinear integer distance set of size n and a strong upper bound on the size of any integer distance set in [-N,N]^2 with no three points on a line and no four points on a circle.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity