Previous Conferences & Workshops

Dec
15
2006

Fundamental Lemma

The Fundamental Lemma and Change of Characteristic (following Waldspurger)
10:30am|S-101

In a recent article, Waldspurger proved that the fundamental lemma for Lie algebras doesn't depend on the characteristic of the base field (among other things...). In this talk, I would like to explain some ideas of the proof of that result.

Dec
14
2006

Birational Geometry

Finite Generation VI: Moduli Spaces
2:00pm|S-101

We will finish the sketch of the proof of existence of a geometrically meaningful compactification of the moduli space of canonically polarized smooth varieties.

Dec
13
2006

Computer Science/Discrete Mathematics Seminar III

Permanents, Determinants and Non-Commutativity
Alistair Sinclair
11:15am|West Building Lecture Theatre

All known efficient algorithms for computing the determinant of a matrix rely on commutativity of the matrix entries. How important is this property, and could we make use of an algorithm that computes determinants without assuming commutativity? In...

Dec
13
2006

Complex Algebraic Geometry

Parabolic Chern Character of the de Rham Bundles
11:00am|S-101

Characteristic classes of Flat bundles on smooth algebraic varieties are defined in various cohomology theories. We consider the de Rham cohomology, the Deligne cohomology and the rational Chow groups and study the classes. We focus on the special...

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...