ACO The ACO Seminar (2021–2022)


Spring 2022

February 17, 3:30pm, Wean 8220
Olha Silina, Carnegie Mellon University
Graph covers with two new eigenvalues

February 24, 3:30pm, Wean 8220
Will Perkins, University of Illinois at Chicago
Sampling, counting, and local central limit theorems

March 17, 3:30pm, Wean 8220
Matan Harel, Northeastern University
The upper tail for triangles in sparse random graphs

March 31, 3:30pm, Wean 8220
Anish Sevekari, Carnegie Mellon University
Comb Inequalities on Typical Euclidean TSP Instances

April 14, 3:30pm, Wean 8220
Zichao Dong, Carnegie Mellon University
Convex polytopes in non-elongated point sets in R^d

April 21, 3:30pm, Wean 8220
Eric Ramos, Bowdoin College
Robertson's Conjecture in topology

April 28, 3:30pm, Wean 8220
Michael Simkin, Harvard University
The number of n-queens configurations

Fall 2021

September 16, 3:30pm, Wean 8220
Patrick Bennett, Western Michigan University
Random greedy independent sets and matchings in some sparse hypergraphs of high girth

September 23, 3:30pm, Wean 8220
R. Amzi Jeffs, Carnegie Mellon University
Open, Closed, and Non-Degenerate Embedding Dimensions of Convex Codes

September 30, 3:30pm, Wean 8220
Tolson Bell, Carnegie Mellon University
The Sunflower Problem

October 7, 3:30pm, Wean 8220
Ting-Wei Chao, Carnegie Mellon University
Finite Field Kakeya Problem

October 14, *No seminar due to university holiday*

October 21, 3:30pm, Wean 8220
Joel Spencer, New York University
Balancing Problems: A Fourfold Approach

October 28, 3:30pm, Wean 8220
Majid Farhadi, Georgia Tech
On Submodular Minimum Linear Ordering

November 4, 3:30pm, Wean 8220
Quentin Dubroff, Rutgers University
Linear cover time is exponentially unlikely

November 11, 3:30pm, Wean 8220
Xiaoyu He, Princeton University
Long common subsequences between bitstrings

November 18, 3:30pm, Wean 8220
Peleg Michaeli, Carnegie Mellon University
Greedy maximal independent sets via local limits

November 25, *No seminar due to Thanksgiving*

December 2, 3:30pm, Wean 8220
Michael (Mik) Zlatin, Carnegie Mellon University
Packing and Covering in Directed Graphs


If you want to be a speaker or have questions or suggestions about the seminar, please contact the organizer, Andrew Newman.

A list of online combinatorics seminars (managed by Jacob Fox and Paul Seymour): Combinatorics Lectures Online

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 2013–14 2014–15 2015–16 2016–17 2017-18 2018-19 2019-20 2020-21

ACO Back to the ACO home page