UCLA Combinatorics Seminar

Department of Mathematics
University of California, Los Angeles

Organizers: Igor Pak and Benny Sudakov



   

Regular meeting time: Thursday 1:50 - 2:50 P.M.
Place: MS 7608
 

Fall 2010 Lectures



Date
Speaker Title and Abstract Slides
September 30 Kenneth Maples, UCLA
The Littlewood-Offord problem in finite fields
October 7, MS 6627, 15:00-15:50 (Colloqium)
Unusual time and place!
Eyal Lubetzky, Microsoft Research
The static and stochastic Ising models
October 14 Jacques Verstraete, UCSD
Regular subgraphs of graphs and hypergraphs
October 21 Ilya Dumer, UC Riverside
Covering a sphere with spheres: Rogers bound revisited
October 28 Adriano Garsia, UCSD
Parking Functions and Diagonal Harmonics: Open Problems and Conjectures
November 4 Po-Shen Loh, Carnegie Mellon University
Packing tight Hamilton cycles in 3-uniform hypergraphs
November 11 Veterans Day
No talk
November 18, Colloqium Christopher Moore (University of New Mexico and the Santa Fe Institute)
Approximate Representations and Approximate Homomorphisms
November 25 Thanksgiving holiday
No talk
December 2 Vladimir Braverman, UCLA
Algorithms for data streams



If you want to be added to our mailing list, please email to:

   bsudakov@math.ucla.edu




Other seminars in Mathematics Department


Talks from Spring 2010

Talks from Winter 2010

Talks from Fall 2009

Talks from Spring 2009

Talks from Winter 2009

Talks from Fall 2008

Talks from Spring 2008