Previous Conferences & Workshops

Oct
31
2007

Mini-Course

Nilsequences in Additive Combinatorics (continuation)
2:00pm|S-101

There has been quite a lot of recent work in additive combinatorics seeking to develop our understanding of the 'higher Fourier analysis' suggested by the work of Gowers on Szemeredi's theorem and the work of various ergodic theorists (Host, Kra...

Oct
30
2007

Arithmetic Combinatorics

On the Property Testing of Hereditary Graph and Hypergraph Properties
Terrence Tao
2:00pm|S-101

Recent work of Alon-Shapira and Rodl-Schacht has demonstrated that every hereditary graph and hypergraph property is testable with one-sided error. This result appears definitive, but there are some subtleties to it that I will present here. For...

Oct
30
2007

Computer Science/Discrete Mathematics Seminar II

Balancing Gaussian Vectors
Kevin Costello
10:30am|S-101

Let ||.|| be any norm on R^d. We consider the question of estimating the minimum over all possible sign sequences e_i=+/-1 of ||e_1 x_1 + e_2 x_2 + ... + e_n x_n||, where the x_i are independent Gaussian vectors on R^d (here d is viewed as fixed and...

Oct
29
2007

Computer Science/Discrete Mathematics Seminar I

Dense Subsets of Pseudorandom Objects
11:15am|S-101

A theorem of Green, Tao and Ziegler can be stated (roughly) as follows: if R is a pseudorandom set, and X is a dense subset of R, then there is a "model" Y for X such that Y is a dense set and X and Y are indistinguishable. (The precise statement...