Title: L-systems and the Lovasz numberSpeaker: William Linz Affiliation: University of South Carolina Location: Please contact Sabrina Lato for Zoom link
Abstract: For positive integers n and k, an L-system is a collection of k-uniform subsets of a set of size n whose pairwise intersection sizes all lie in in the set L. The maximum size of an L-system is equal to the independence number of a certain union of graphs in the Johnson scheme. The Lovasz number is a semidefinite programming approximation of the independence number of a graph. In this talk, we survey the relationship between the maximum size of an L-system and the Lovasz number, illustrating examples both where the Lovasz number is a good approximation and where it is a bad approximation.
Title: Research in ApplicationsSpeaker: Ricardo Fukasawa Affiliation: University of Waterloo Location: MC 5479
Abstract: In this talk I will present my personal experiences in doing research involving applications. I will go over some of my work, presenting some of the key aspects that are involved, and trying to take stock of a few lessons learned.