Additional Public Info:
The classical Ramsey theorem says that if n is large enough, then every
graph with at least n vertices contains either a k-clique or a k-anticlique
—- that is, a set of k vertices among which either all edges are present or
none are present. I will explain a recent version of this theorem for complex
matrices which arose in the theory of quantum error correction. The talk
should be accessible to graduate students.

Refreshments will be served 3:30-4:00 in 348 Avery. The talk is free and open to the public.

Download this event to my calendar