Applications of Pseudorandomness and High-Dimensional Expansion

The workshop will focus on applications of pseudorandomness and high dimensional expanders to areas in computer science and mathematics. A tentative list of areas covered will be applications in coding theory, in particular to local codes both classical and quantum; the construction of expanders with almost full vertex expansion; improved bounds for the PCP theorem and its application to hardness of approximation; Markov Chain Monte Carlo (MCMC) algorithms and their analysis; and applications in pure math, in particular in combinatorics and analysis.