Combinatorics in general and the theory of expander graphs in particular, have been fruitful areas of interaction between pure and applied mathematics. In recent years a “high dimensional” theory has emerged. This theory, aside from its intellectual interest, also has great potential for various applications in mathematics and computer science. This theory calls for a collaboration of experts in combinatorics, topology, geometry, group theory and computer science.
Speakers include:
David ConlonUniversity of OxfordMichael FarberQueen Mary, University of LondonHoward Garland*Yale UniversityLev GlebskyUniversidad Autónoma de San Luis PotosíMisha Gromov*IHESVenkatesan GuruswamiCarnegie Mellon UniversityMing-Hsuan KangNational Chiao Tung UniversityDaniela KühnUniversity of BirminghamJames LeeUniversity of WashingtonWinnie LiPennsylvania State UniversityShachar LovettUC San DiegoRoy MeshulamTechnionDeryk OsthusUniversity of BirminghamJános PachNYUPeter SarnakIAS, PrincetonLeonard SchulmanCaltechUli WagnerISTShmuel WeinbergerUniversity of ChicagoAvi WigdersonIAS, PrincetonGilles ZémorUniversité de Bordeaux
