Seminar: May 18
Alex Samorodnitsky, Hebrew University and Radcliffe Institute
Maximal eigenvalues of subgraphs in the Hamming cube
Consider the following function:
Lambda(t) = the maximal eigenvalue of an induced t-vertex subgraph of the cube (maximum over all such subgraphs)
We will describe bounds on Lambda(t), discuss connections to isoperimetry and coding theory, and, in general, try to argue that this function is interesting.