Previous Conferences & Workshops

Oct
06
2010

Galois Representations and Automorphic Forms Mini-Course

The Completed Cohomology of Arithmetic Groups
Frank Calegari
1:30pm|S-101

The cohomology of arithmetic groups (with real coefficients) is usually understood in terms of automorphic forms. Such methods, however, fail (at least naively) to capture information about torsion classes in integral cohomology. We discuss a...

Oct
05
2010

Geometry and Cell Complexes Seminar

Topology of Random Simplicial Complexes
2:00pm|S-101

In this talk I will overview two very different kinds of random simplicial complex, both of which could be considered higher-dimensional generalizations of the Erdos-Renyi random graph, and discuss what is known and not known about the expected...

Oct
05
2010

Computer Science/Discrete Mathematics Seminar II

Pseudorandom Generators for CCO[p] and the Fourier Spectrum of Low-Degree Polynomials Over Finite Fields
10:30am|S-101

We give a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp gates, for prime p. More accurately, the seed length of our generator is O(log n) for any constant error epsilon...

Oct
04
2010

Members’ Seminar

Potential Automorphy
2:00pm|S-101

I will introduce l-adic representations and what it means for them to be automorphic, talk about potential automorphy as an alternative to automorphy, explain what can currently be proved (but not how) and discuss what seem to me the important open...

Oct
04
2010

Computer Science/Discrete Mathematics Seminar I

Super-uniformity of the typical billiard path (proof included)
Jozsef Beck
11:15am|S-101

I will describe the proof of the following surprising result: the typical billiard paths form the family of the most uniformly distributed curves in the unit square. I will justify this vague claim with a precise statement. As a byproduct, we obtain...

Sep
30
2010

Short Talks by Postdoctoral Members

Sparce Approximation of PSD Matrices
2:15pm|S-101

I will discuss the problem of approximating a given positive semidefinite matrix A , written as a sum of outer products vv^T , by a much shorter weighted sum in the same outer products. I will then mention an application to sparsification of finite...