Video Lectures

Proof systems pervade all areas of mathematics (often in disguise: e.g. Reidemeister moves is a sound and complete proof system for proving the equivalence of knots given by their diagrams). Proof complexity seeks to to understand the minimal...

The last few years have seen substantial progress on the question of proving lower bounds for homogeneous depth-4 arithmetic circuits. Even though these results seem to come close to resolving the VP vs VNP question, it seems likely that the...

The deep sea covers roughly two-thirds of Earth's surface, yet we know very little about it. Donato Giovannelli, Visitor in the Program in Interdisciplinary Studies, will lead you on a journey to the darkest, deepest places on our planet, where life...

On July 14, 2015, The P5+1 group of world powers and Iran signed a comprehensive nuclear agreement, aiming to limit Iran’s ability to advance its nuclear program towards achieving nuclear weapons. Eli Waxman, Professor at the Weizmann Institute of...

Iwasawa theory is a powerful technique for understanding the link between the special values of L-functions and arithmetic objects (such as class groups of number fields, or Mordell-Weil groups of elliptic curves). In this talk I'll discuss what...

We prove that any right-angled Coxeter group on $k$ generators admits a proper action by affine transformations on $\mathbb R^{k(k-1)/2}$. As a corollary, many interesting groups admit proper affine actions including surface groups, hyperbolic three...

Numerous manifestations of wave localization permeate acoustics, quantum physics, mechanical and energy engineering. It was used in construction of noise abatement walls, LEDs, optical devices, to mention just a few applications. Yet, no systematic...

We prove that any algorithm for learning parities requires either a memory of quadratic size or an exponential number of samples. This proves a recent conjecture of Steinhardt, Valiant and Wager and shows that for some learning problems a large...

Finding cliques in random graphs and the related planted variant where one wants to recover an added clique of size $k$ added to a random $G(n, 1/2)$ graph, have been extensively studied questions in algorithm design. Despite intense effort, state...

After recalling some recent developments in symplectic flexibility, I will introduce a class of open symplectic manifolds, called "subflexible", which are not flexible but become so after attaching some Weinstein handles. For example, the standard...