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 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.
This lecture will describe the historical context and some key properties of o-minimality. It will then describe certain results in functional transcendence, generalizing the classical results on exponentiation due to Ax, and sketch how they can be proved.
This talk is mainly concerned with the investigation of small set expansion on the Grassmann Graphs, a study that was motivated by recent applications to Probabilistically Checkable Proofs and hardness of approximation.
This introductory lecture will describe results about counting rational points on certain non-algebraic sets and sketch how they can be used to attack certain problems in diophantine geometry and functional transcendence.