Lev Reyzin, Dima Sinapova
Open House Colloquium
Abstract: There will be two 30min talks. Part I. Lev Reyzin: A Few TCS Problems on Graphs I will give a few vignettes, each about a theoretical computer science (TCS) problem that my students and I have been worked on during the last few years. One common theme will be that these problems concern graphs, thereby being easier to intuitively understand in a short talk. I will end each vignette with a tempting open problem. Part II. Dima Sinapova: Truth and infinity. Famously, in 1963 Cohen invented the breakthrough method of forcing and used it to show that the continuum hypothesis is independent of ZFC, resolving Hilbert's first problem. Since then, a long standing project in set theory has been to use forcing for relative consistency results and to analyze cardinal arithmetic, especially for singular cardinals. I will go over some background and then discuss current research in singular combinatorics.
This special event is part of the Open House for the prospective graduate students that the department hosts on Friday, March 10. All are welcome!
Friday March 10, 2017 at 3:00 PM in SEO 636