Title: Orthogonal basis of eigenvectors for the Johnson and Kneser graphsSpeaker: Yuval Filmus Affiliation: Technion Location: Please contact Sabrina Lato for Zoom link
Abstract: The Johnson and Kneser graphs have the same eigenspaces. How explicitly can we describe these eigenspaces?
Title: The matching polytope has exponential extension complexitySpeaker: Jacob Skitsko Affiliation: University of Waterloo Location: MC 6029
Abstract: This Friday we will build off of some previous results by looking at the paper “The matching polytope has exponential extension complexity” by Thomas Rothvoss! At the beginning of the semester, we saw that the matching (and TSP) polytopes cannot be expressed by a polynomial sized symmetric LP.
Title: A brief introduction to lattice-based cryptographySpeaker: Douglas Stebila Affiliation: University of Waterloo Location: MC 5479
Abstract: A brief introduction to lattice-based cryptography, one of the leading candidates for building quantum-resistant cryptosystems.