Previous Conferences & Workshops

Mar
30
2011

Mathematical Conversations

Expander Graphs: Why Number Theorists Might Care About Network Optimization
Elena Fuchs
6:00pm|S-101
Mar
29
2011

Special Seminar

Limit Theorems for the M\"{o}bius Function and Statistical Mechanics
Francesco Cellarosi
4:00pm|S-101

I will present a recent joint work with Ya.G. Sinai. We investigate the ``randomness" of the classical Möbius function by means of a statistical mechanical model for square-free numbers and we prove some new results, including a non-standard limit...

Mar
29
2011

Special Seminar

Uniqueness of Enhancements for Triangulated Categories
Dmitry Orlov
2:00pm|S-101

I am going to talk about triangulated categories in algebra, geometry and physics and about differential-graded (DG) enhancements of triangulated categories. I will discuss such properties of DG enhancements as uniqueness and existing. It can be...

Mar
29
2011

Computer Science/Discrete Mathematics Seminar II

General Hardness Amplification of Predicates and Puzzles
Grant Schoenbeck
10:30am|S-101

In this talk, I will give new proofs for the hardness amplification of fficiently samplable predicates and of weakly verifiable puzzles. More oncretely, in the first part of the talk, I will give a new proof of Yao's XOR-Lemma as well as related...

Mar
28
2011

Computer Science/Discrete Mathematics Seminar I

Non-negatively Weighted #CSPs: An Effective Complexity Dichotomy
Xi Chen
11:15am|S-101

We prove a complexity dichotomy theorem for all non-negatively weighted counting Constraint Satisfaction Problems (#CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms and the...