ACO The ACO Seminar (2013–2014)

Spring 2014

Feb. 6, 3:30pm, Wean 8220
Victor Grinberg, Independent Scholar
Block Partitions of Sequences

Feb. 20, 3:30pm, Wean 8220
Pawel Pralat, Ryerson University
A few random open problems, some of them for random graphs

Mar. 6, 3:30pm, Wean 8220
Wesley Pegden, Carnegie Mellon University
Between 2- and 3-colorability

Mar. 20, 4:30pm, Wean 8220   (Note unusual time)
Daniel Kane, Stanford University
On a problem related to the ABC conjecture

Mar. 27, 3:30pm, Wean 8220
Mike Picollelli, Carnegie Mellon University
The diamond-free process

Apr. 3, 3:30pm, Wean 8220
Bhargav Narayanan, University of Cambridge
Exactly m-coloured graphs

Apr. 17, 3:30pm, Wean 8220
Imre Bárány, Rényi Mathematical Institute and University College London
On a geometric Ramsey number

May. 1, 3:30pm, Wean 8220
Carl Yerger, Davidson College
Steinberg's Conjecture, the Bordeaux Coloring Conjecture and Near-Coloring

Fall 2013

Sep. 5, 3:30pm, Wean 8220
Ben Barber, University of Cambridge
Partition regularity in the rationals

Sep. 12, 3:30pm, Wean 8220
Nathasha Komarov, Carnegie Mellon University
Cop vs. Gambler

Sep. 19, 3:30pm, Wean 8220
Jie Ma, Carnegie Mellon University
Graphs with maximum number of proper q-colorings and a conjecture of Lazebnik

Sep. 26, 3:30pm, Wean 8220
Santosh Vempala, Georgia Tech
On the Complexity of Random Problems with Planted Solutions

Oct. 3, 3:30pm, Wean 8220
Michael Krivelevich, Tel Aviv University
Smoothed analysis on connected graphs

Oct. 10, 3:30pm, Wean 8220
Hao Huang, IAS and Rutgers University
The minimum number of nonnegative edges in hypergraphs

Oct. 17, 3:30pm, Gates 7501   (Note unusual location)
Michael Saks, Rutgers University
Population recovery with high erasure probability

Oct. 25, 4:00pm, Gates 6115   (Note unusual day, time, and location)
Yuval Peres, Microsoft Research
Hidden cliques in large graphs, search games and Kakeya sets  (CSD Distinguished Lecture)

Oct. 31, 3:30pm, Wean 8220
Ameerah Chowdhury, Carnegie Mellon University
A proof of the Manickam–Miklós–Singhi conjecture for vector spaces

Nov. 7, 3:30pm, Gates 4401    (Note unusual location)
Shafi Goldwasser, MIT and Weizman
The Cryptographic Lens  (SCS Distinguished Lecture)

Nov. 14, 3:30pm, Wean 8220
Liu Yang, MIT and CMU
Online Allocation and Pricing with Economies of Scale

Nov. 21, 3:30pm, Wean 8220
Constantinos Daskalakis, MIT
An Optimization Approach to Mechanism Design

Nov. 22, 3:30pm, Wean 8220   (Note unusual day)
Nayantara Bhatnagar, University of Delaware
Lengths of Monotone Subsequences in a Mallows Permutation

Nov. 28, everywhere except Wean 8220
Turkey, Thanksgiving

Dec. 5, 3:30pm, Wean 8220
Adam Sheffer, Tel Aviv University
Recent progress in distinct distances problems

Dec. 16, 3:30pm, Wean 8220
Dhruv Mubayi, University of Illinois at Chicago
Intersection Theorems for Finite Sets

If you want to be a speaker or have questions or suggestions about the seminar, please contact the organizer: Boris Bukh ()

Subscribe to the ACO seminar mailing list

Past Schedule:

1995–96 1996–97 1998–99 1999–00 2000–01 2001–02 2004–05 2005–06 2006–07 2007–08 2008–09 2009–10 2010–11 2011–12 2012–13

ACO Back to the ACO home page