The Sylvester-Gallai Theorem states that, given any set P of n points in the plane not all on one line, there is at least one line through precisely two points of P. Such a line is called an ordinary line. How many ordinary lines must there be? The Sylvester-Gallai Theorem says that there must be at least one but, in recent joint work with T. Tao, we have shown that there must be at least n/2 if n is even and at least 3n/4 - C if n is odd, provided that n is sufficiently large. These results are sharp
This is a lecture given on the occasion of the launch of the PIMS CRG in "L-functions and Number Theory".
The theory of expander graphs is undergoing intensive development. It finds more and more applications to diverse areas of mathematics. In this talk, aimed at a general audience, I will introduce the concept of expander graphs and discuss some interesting connections to arithmetic geometry, group theory and cryptography, including some very recent breakthroughs.
Some photos from the Hyperplane Arrangements and Applications conference which took place at UBC Vancouver, August 8-12. This conference was held in honour of Hiroaki Terao.