The structure-vs-pseudorandomness approach is a powerful framework in mathematics and theoretical computer sciences. Important applications of this approach include Roth's theorem, Szemerédi's regularity lemma, and sunflower lemma. In this talk, I will introduce the plain structure-vs-pseudorandomness framework, and discuss its applications in diverse areas such as extremal combinatorics, communication complexity, and streaming lower bounds.

Jiapeng Zhang is an assistant professor at the University of Southern California. His research has mainly focused on theoretical computer science. He received a PhD from the University of California, San Diego, and then did a Postdoc at Harvard.