Title: Not colouring the 3-sphereSpeaker: Chris Godsil Affiliation: Unioversity of Waterloo Room: MC 6486
Let S(3) be the graph formed by the unit vectors in R3, two vectors adjacent if they are orthogonal. I will prove that S(3) has no 3-colouring.
Title: High-dimensional probability: Bernstein's InequalitySpeaker: Jimit Majmudar Affiliation: University of waterloo Room: MC 5417
We will extend our study of concentration inequalities so far to random matrices.