Previous Conferences & Workshops

Nov
08
2010

Computer Science/Discrete Mathematics Seminar I

The Graph Removal Lemma
Jacob Fox
11:15am|S-101

Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(n^h) copies of H can be made H-free by removing o(n^2) edges. We give a new proof which avoids Szemeredi's regularity lemma and gives a...

Nov
05
2010

Analysis/Mathematical Physics Seminar

Ground States of the 2D Edwards-Anderson Spin Glass
Michael Damron
2:00pm|S-101

I will discuss the problem of determining the number of infinite-volume ground states in the Edwards-Anderson (nearest neighbor) spin glass model on Z^D for D \geq 2. There are no complete results for this problem even in D=2. I will focus on this...

Nov
04
2010

Galois Representations and Automorphic Forms Seminar

A Satake Isomorphism mod.p
2:15pm|S-101

Let F be a locally compact non-Archimedean field, p its residue characteristic and G a connected reductive algebraic group over F . The classical Satake isomorphism describes the Hecke algebra (over the field of complex numbers) of double classes in...

Nov
03
2010

Galois Representations and Automorphic Forms Mini-Course

Local-Global Compatibility in the p-Adic Langlands Progra for GL(2) over Q
Matthew Emerton
1:00pm|S-101

I will outline the proof of various cases of the local-global compatibility statement alluded to in the title, and also explain its applications to the Fontaine--Mazur conjecture, and to a conjecture of Kisin.

Nov
02
2010

Galois Representations and Automorphic Forms Mini-Course

Local-Global Compatibility in the p-Adic Langlands Program for GL(2) over Q
Matthew Emerton
2:15pm|West Bldg. Lecture Hall

I will outline the proof of various cases of the local-global compatibility statement alluded to in the title, and also explain its applications to the Fontaine—Mazur conjecture, and to a conjecture of Kisin.

Nov
02
2010

Geometry and Cell Complexes Seminar

The Topology of Restricted Partition Posets
2:00pm|S-101

The d-divisible partition lattice is the collection of all partitions of an n-element set where each block size is divisible by d. Stanley showed that the Mobius function of the d-divisible partition lattice is given (up to a sign) by the number of...