ACO The ACO Seminar (2018–2019)

Spring 2019

January 31, 3:30pm, Wean 8220
Michael Anastos, Carnegie Mellon University
Coloring (random) hypergraphs

February 14, 3:30pm, Wean 8220
Cliff Smyth, UNC Greensboro
Restricted Stirling and Lah matrices and their inverses

February 21, 3:30pm, Wean 8220
Neil Gillespie, University of Bristol
Equiangular lines in Euclidean space and Incoherent sets

February 22, 3:30pm, Wean 8220 (note unusual day: Friday)
Simcha Haber, Bar-Ilan University
Logical properties of random graphs

March 8, 3:30pm, Wean 8220 (note unusual day: Friday)
Harald Helfgott, University of Gottingen
Summing mu(n): a better elementary algorithm

March 21, 3:30pm, Wean 8220
Patrick Bennett, Western Michigan University
Large triangle packings and Tuza's conjecture in random graphs

March 28, 3:30pm, Wean 8220
Bruno Benedetti, University of Miami
Polytope Graphs and Lines on Algebraic Surfaces

April 4, 3:30pm, Wean 8220
Jane Gao, University of Waterloo
The rank of random matrices over finite fields

April 18, 3:30pm, Wean 8220
Sebi Cioaba, University of Delaware
The smallest eigenvalues of Hamming, Johnson and other graphs

April 25, 3:30pm, Wean 8220
Jürgen Kritschgau, Iowa State University
Few H copies in F-saturated graphs

May 2, 3:30pm, Wean 8220
Amzi Jeffs, University of Washington
A deep dive into the abyss of convex neural codes

May 9, 3:30pm, Wean 8220
Cynthia Vinzant, NC State University
Completely log-concave polynomials and matroids

Fall 2018

September 6, 3:30pm, Wean 8220
Ahmad Abdi, Carnegie Mellon University
Primal and total dual integrality of set covering linear programs

September 20, 3:30pm, Wean 8220
Will Perkins, University of Illinois at Chicago
Algorithmic Pirogov Sinari theory

September 27, 3:30pm, Wean 8220
Sophie Spirkl, Rutgers University
Complete and anticomplete sets in graphs with forbidden induced subgraphs

October 4, 3:30pm, Wean 8220
Joseph Cheriyan, University of Waterloo

October 11, 3:30pm, Wean 8220
Michael Simkin, Hebrew University of Jerusalem
Perfect matchings in random subgraphs of regular bipartite graphs

October 18, 3:30pm, Wean 8220
Caleb C. Levy, Princeton University
A New Path from Splay to Dynamic Optimality

October 25, 3:30pm, Wean 8220
Michelle Delcourt, University of Waterloo
Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold

November 1, 3:30pm, Wean 8220
Caroline Terry, University of Chicago
A stable arithmetic regularity lemma in finite abelian groups

November 8, 3:30pm, Wean 8220
Pablo Soberon, Baruch College, CUNY
Random partitions and the Colorful Tverberg theorem

November 15, 3:30pm, Wean 8220
Beatrice-Helen Vritsiou, University of Alberta
Regular covering for non-symmetric convex bodies

November 29, 3:30pm, Wean 8220
Yuval Peled, Courant Institute
Enumeration and randomized construction of hypertrees

December 6, 3:30pm, Wean 8220
Thao Do, MIT
A general incidence bound in high dimensions

If you want to be a speaker or have questions or suggestions about the seminar, please contact the organizer: Michael Tait (mtait at cmu dot edu)

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

ACO Back to the ACO home page