On the NP-hardness of 2-to-2 Games

Dor Minzer
Member, School of Mathematics
October 30, 2018

The Unique-Games Conjecture is a central open problem in the field of PCP’s (Probabilistically Checkable Proofs) and hardness of approximation, implying tight inapproximability results for wide class of optimization problems. 

We will discuss PCPs, the Unique-Games Conjecture and some recent progress. (no familiarity with PCPs or with last week's talk are needed).


The Zilber-Pink conjecture

Jonathan Pila
University of Oxford
October 26, 2018

The Zilber-Pink conjecture is a far reaching finiteness conjecture in diophantine geometry, unifying and extending Mordell-Lang and Andre-Oort. This lecture will state the conjecture, illustrate its varied faces, and indicate how the point-counting strategy can be applied to parts of it.

Irreducible components of affine Deligne-Lusztig varieties and orbital integrals

Rong Zhou
Member, School of Mathematics
October 25, 2018
Affine Deligne-Lusztig varieties (ADLV) naturally arise in the study of Shimura varieties and Rapoport-Zink spaces; their irreducible components give rise to interesting algebraic cycles on the special fiber of Shimura varieties. We prove a conjecture of Miaofen Chen and Xinwen Zhu, which relates the number of irreducible components of ADLV's to a certain weight multiplicity for a representation of the Langlands dual group.