Previous Conferences & Workshops

Dec
12
2006

Computer Science/Discrete Mathematics Seminar II

Cycles and Cliques Minors in Expanders
Benny Sudakov
10:30am|S-101

Let $G$ be a graph which contains no subgraphs isomorphic to fixed bipartite graph $H$. Using well known results from Extremal Graph theory, one can show that such $G$ has certain expansion properties, i.e., all small subsets of $G$ have large...

Dec
11
2006

Members’ Seminar

On the Geometric Langlands Functoriality for the Dual Pair Sp_{2n}, SO_{2m}
4:00pm|S-101

I will report on a the following work in progress. Let X be a smooth connected curve over an algebraically closed field. Consider the dual pair H=SO_{2m}, G=Sp_{2n} over X with H split. Let Bun_G and Bun_H be the stacks of G-torsors and H-torsors on...

Dec
11
2006

Computer Science/Discrete Mathematics Seminar I

Approximation Algorithms for Combinatorial Allocation Problems
11:15am|S-101

In combinatorial allocation, m items are to be assigned to n players so that their total utility is maximized. This problem has many variants depending on the utility functions involved and possible additional constraints. We consider two variants...

Dec
07
2006

Complex Algebraic Geometry

Witten Equation and Singularity Theory
Yongbin Ruan
12:00pm|S-101

In 1991, Witten proposed a famous conjecture (solved by Kontsevich) related the intersection theory of Deligne-Mumford moduli space to KDV-integrable hierearchy. To generalize his conjecture, Witten proposed a remarkable PDE based any...

Dec
06
2006

Mathematical Physics Seminar

The Renormalisation Group II
2:30pm|S-101

This is continuation of the previous seminar in which the formulation of the renormalisation group is given in more detail: a space of statistical mechanical models is defined. The renormalisation group is a map on this space and there is a basic...

Dec
05
2006

Computer Science/Discrete Mathematics Seminar II

On the Correlation Between Parity and Modular Polynomials
10:30am|S-101

We consider the problem of bounding the absolute value of the correlation between parity and low-degree polynomials modulo q, for odd q >= 3. The boolean function corresponding to the polynomial is 0 on an input iff the polynomial evaluates to 0...

Dec
04
2006

Members’ Seminar

The Renormalisation Group I
4:00pm|S-101

A very long random walk, seen from so far away that individual steps cannot be resolved, is the continuous random path called Brownian motion. This is a rough statement of Donsker's theorem and it is an example of how models in statistical mechanics...