Title: Polynomial SpacesSpeaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5417
We describe some simple machinery that enables us to derive upper bounds on the size of codes, and lower bounds on the size of designs in a quite general setting.
Title: Combinatorial questions motivated by Invariant TheorySpeaker: Matthew Satriano Affiliation: University of Waterloo Room: MC 5417
We begin the talk by discussing a question in Invariant Theory: given a representation $V$ of a Lie group $G$, when if the invariant ring $k[V]^G$ a polynomial ring? We give a conjectural answer which we have verified for $SL_n$ and discuss some combinatorial questions motivated by the proof. This is joint work with Dan Edidin.