Video Lectures

Given a bounded domain $\Omega$, the harmonic measure $\omega$ is a probability measure on $\partial \Omega$ and it characterizes where a Brownian traveller moving in $\Omega$ is likely to exit the domain from. The elliptic measure is a non...

One of the major goals of complexity theory is to prove lower bounds for various models of computation. The theory often proceeds in buckets of three steps. The first is to come up with a collection of techniques. The second is to be frustrated at...

A linear matrix is a matrix whose entries are linear forms in some indeterminates $t_1,\dots, t_m$ with coefficients in some field $F$. The commutative rank of a linear matrix is obtained by interpreting it as a matrix with entries in the function...

Randomness dispersers are an important tool in the theory of pseudorandomness, with numerous applications. In this talk, we will consider one-bit strong dispersers and show their connection to erasure list-decodable codes and Ramsey graphs.

The...