The classical Dvoretzky theorem asserts that for every integer k>1 and every target distortion D>1 there exists an integer n=n(k,D) such that any
Listen to members of the Borromeo String Quartet discuss music with Institute Artist-in-Residence Derek Bermel.
Infinite continuous graphs emerge naturally in the geometric analysis of closed planar sets which cannot be presented as countable union of convex sets. The classification of such graphs leads in turn to properties of large classes of real functions - e.g. the class of Lipschitz continuous functions - and to meta-mathematical properties of sub-ideals of the meager ideal (the sigma-ideal generated by nowhere dense sets over a Polish space) which reduce to finite Ramsey-type relations between random graphs and perfect graphs.
Didier Fassin, James D. Wolfensohn Professor, School of Social Science
Jonathan Israel, Professor, School of Historical Studies
Avishai Margalit, George F. Kennan Professor, School of Historical Studies
Joan Wallach Scott, Harold F. Linder Professor, School of Social Science