Past Events

2008-2009

Apr 23

Maria Chudnovsky, Columbia University

Packing seagulls in graphs with no stable set of size three
Fine Hall 801 / -
Apr 16

Boris Bukh, Princeton University and UCLA

Geometric selection theorems
Fine Hall 224 / -
Apr 09

William Cook, Georgia Institute of Technology

Linear Programming Relaxations for the TSP
Fine Hall 224 / -
Apr 03

Jeff Kahn, Rutgers University

The number of 3-SAT functions
Fine Hall 224 / -
Mar 26

Po-Shen Loh, Princeton University and UCLA

Avoiding small subgraphs in Achlioptas processes
Fine Hall 224 / -
Mar 12

Van Vu, Rutgers University

Inverse Littlewood-Offord theory, Smooth Analysis and the Circular Law
Fine Hall 224 / -
Mar 05

Zeev Dvir, IAS

New bounds on the size of Kakeya sets in finite fields
Fine Hall 224 / -
Feb 26

Joel Spencer, Courant Institute for Mathematics, NYC

Finding Lovasz's Needle in an Exponential Haystack
Fine Hall 224 / -
Feb 19

Avi Wigderson, IAS

Randomness extractors - applications and constructions
Fine Hall 224 / -
Feb 12

Jan Hladky, Charles University, Prague

Square-paths and square-cycles in graphs with high minimum degree
Fine Hall 322 / -
Feb 05

Hoi H. Nguyen, Rutgers University

On simple additive configurations in random sets
Fine Hall 224 / -
Dec 11

Paul Wollan, Universität Hamburg

Packing cycles with modularity
Fine Hall 224 / -
Dec 03

Robin Thomas, Georgia Institute of Technology

Coloring triangle-free graphs on surfaces
Fine Hall 224 / -
Nov 21

Melvyn B. Nathanson, The City University of New York

Quasi-isometries, phase transitions, and other problems in additive number theory
Fine Hall 1201 / -
Nov 06

Philip Matchett Wood, Rutgers University

On the Singular Probability of Random Discrete Matrices
Fine Hall 224 / -
Oct 23

Noga Alon, Tel-Aviv University and IAS

Eliminating cycles in the torus via isoperimetric inequalities
Fine Hall 224 / -
Oct 16

Oleg Pikhurko, Carnegie-Mellon University

The Maximum Number of Colorings of Graphs of Given Order and Size
Fine Hall 224 / -
Sep 25

Alexandra Ovetsky Fradkin, Princeton University

An approximate version of Hadwiger's conjecture for claw-free graphs
Fine Hall 224 / -