## Seminars and Colloquia by Series

Series: PDE Seminar
Tuesday, February 26, 2019 - 15:00 , Location: Skiles 006 , Professor Hongjie Dong , Brown University , , Organizer: Xukai Yan
Monday, February 25, 2019 - 15:30 , Location: Skiles 006 , Chris Davis , U Wisconsin Eau Claire , Organizer: Caitlin Leverson
Monday, February 25, 2019 - 14:00 , Location: Skiles 006 , Lisa Piccirillo , UT Austin , Organizer: Caitlin Leverson
Thursday, February 21, 2019 - 15:05 , Location: Skiles 006 , , University of Rochester , , Organizer: Michael Damron
Wednesday, February 20, 2019 - 13:55 , Location: Skiles 005 , Steven Heilman , USC , Organizer: Galyna Livshyts
TBA
Wednesday, February 20, 2019 - 12:55 , Location: Skiles 006 , Steven Heilman , USC , Organizer: Galyna Livshyts
TBA
Thursday, February 14, 2019 - 15:05 , Location: Skiles 006 , C. Houdre , SOM, GaTech , Organizer: Christian Houdre
Thursday, February 14, 2019 - 15:00 , Location: Skiles 005 , Dhruv Mubayi , University of Illinois at Chicago , Organizer: Prasad Tetali
After a brief introduction to classical hypergraph Ramsey numbers, I will focus on the following problem. What is the minimum t such that there exist arbitrarily large k-uniform hypergraphs whose independence number is at most polylogarithmic in the number of vertices and every s vertices span at most t edges? Erdos and Hajnal conjectured (1972) that this minimum can be calculated precisely using a recursive formula and Erdos offered \$500 for a proof. For k=3, this has been settled for many values of s, but it was not known for larger k. Here we settle the conjecture for all k at least 4. Our method also answers a question of Bhatt and Rodl about the maximum upper density of quasirandom hypergraphs. This is joint work with Alexander Razborov.
Wednesday, February 13, 2019 - 15:00 , Location: Skiles 006 , Greg Blekherman , Georgia Tech , Organizer: Galyna Livshyts
TBA
Wednesday, February 13, 2019 - 14:00 , Location: Skiles 006 , Monica Flamann , Georgia Tech , Organizer: Sudipta Kolay