Previous Conferences & Workshops

Jan
15
2007

Computer Science/Discrete Mathematics Seminar I

How to Rank with Few Errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Warren Schudy
11:15am|S-101

Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic, so you could not just sort the players by who beat whom. A natural...

Dec
19
2006

Computer Science/Discrete Mathematics Seminar II

Sum-Product Estimates, Expanders, and Sieving
Alex Gamburd
10:30am|S-101

We prove that Cayley graphs of SL_2(Z/qZ) are expanders with respect to the projection of any fixed elements in SL_2(Z) generating a non-elementary subgroup. This expansion property plays crucial role in establishing almost prime version of "SL_2(Z)...

Dec
18
2006

Computer Science/Discrete Mathematics Seminar I

On the Computation and Approximation of Two-Player Nash Equilibria
11:15am|S-101

In 1950, Nash showed that every non-cooperative game has an equilibrium. Before his work, the result was known only for two-player zero-sum games. While von Neumann's minimax theorem was the mathematical foundation of the two-player zero-sum game...

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