School of Mathematics

A "sparsifier" of a graph is a weighted subgraph for which every cut has approximately the same value as the original graph, up to a factor of (1 +/- eps). Sparsifiers were first studied by Benczur and Karger (1996). They have wide-ranging...

Recursive Majority-of-three (3-Maj) is a deceptively simple problem in the study of randomized decision tree complexity. The precise complexity of this problem is unknown, while that of the similarly defined Recursive NAND tree is completely...

March 21-25,2011

http://www.ias.edu/math/sp/graf

MATHEMATICAL CONVERSATIONS

"We know that God exists because mathematics is consistent and we know that the devil exists because we cannot prove the consistency." -- Andre Weil

SPECIAL LECTURE

Let Gamma be a non-cocompact lattice on a right-angled building X. Examples of such X include products of trees, or Bourdon's building I_{p,q}, which has apartments hyperbolic planes tesselated by right-angled p-gons and all vertex...

GALOIS REPRESENTATIONS AND AUTOMORPHIC FORMS SEMINAR

Note: (joint work with O. Brinon and A. Mokrane)