Algebraic Graph Theory Seminar - Chris Godsil

Title: Polynomial Spaces

Abstract:

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. We will focus on a connection between designs and orthogonal polynomials; this connect leads to the so-called linear programming bounds (but we will not get that far this time).