## Towards optimal Ramsey graphs and randomness extractors

Eshan Chattopadhyay

Member, School of Mathematics

September 26, 2017

Eshan Chattopadhyay

Member, School of Mathematics

September 26, 2017

Ashay Burungale

Member, School of Mathematics

September 26, 2017

Guillaume Brunerie

Member, School of Mathematics

September 26, 2017

Nathaniel Bottman

Member, School of Mathematics

September 26, 2017

Irina Bobkova

Member, School of Mathematics

September 26, 2017

Tony Yue Yu

Member, School of Mathematics

January 30, 2017

Dhruv Ranganathan

Member, School of Mathematics

January 30, 2017

Ailsa Keating

Member, School of Mathematics

January 30, 2017

Pravesh Kothari

Member, School of Mathematics

September 20, 2016

Eshan Chattopadhyay

Member, School of Mathematics

September 20, 2016

A resilient function $f: X^n to \{0,1\}$, for some set $X$, is such that every subset of coordinates of bounded size has small influence on the function. Such functions have applications in computer science, and are of independent interest of study as well. In this talk, I will motivate resilient functions from an application in distributed computing, present some known results on resilient functions and open directions for future work.