ACO The ACO Seminar (2019–2020)

Spring 2020

Zoom link for ACO seminars: Please email Anton Bernshteyn (abernsht ~at~ for a password.

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

January 16, 3:30pm, Wean 8220
Jonathan Mosheiff, Carnegie Mellon University
Equations in permutations: stability and testability

January 23, 3:30pm, Wean 8220
Kaave Hosseini, Carnegie Mellon University
A bilinear Bogolyubov–Ruzsa lemma with polylogarithmic bounds

January 30, 3:30pm, Wean 8220
Oleg Pikhurko, University of Warwick
Measurable version of Vizing's theorem

February 6, 3:30pm, Wean 8220
Nicholas Mayers, Lehigh University
The index and spectrum of Lie poset algebras

February 13, 3:30pm, Wean 8220
Alperen Ergür, Carnegie Mellon University
How many zeros of a sparse random polynomial system are real?

February 20, 3:30pm, Wean 8220
Bhargav Narayanan, Rutgers University

February 27, 3:30pm, Wean 8220
Liana Yepremyan, University of Illinois at Chicago
Rainbow structures in graphs

March 5, 3:30pm, Wean 8220
Alexander Barvinok, University of Michigan
The interpolation method

March 12, 3:30pm, Wean 8220
Ron Holzman, Technion – Israel Institute of Technology & Princeton University
On 2-colored graphs and partitions of boxes

March 19

March 26

April 9, 3:30pm,
Shweta Jain, University of California, Santa Cruz
Counting cliques in real-world graphs, [Recording; technical problems until 4:45]

April 16, 3:30pm,
Lionel Levine, Cornell University
CoEulerian graphs, [Recording]

April 23, 3:30pm,
Jonah Gaster, University of Wisconsin-Milwaukee
Discrete and continuous harmonic maps between hyperbolic surfaces, [Recording]

April 30, 3:30pm,
Elisabeth Werner, Case Western Reserve University
\(L_p\) affine surface areas and extremal affine surface areas, [Recording]

May 7, 3:30pm,
Jesse Goodman, Cornell University
Extractors for adversarial sources via extremal hypergraphs, [Recording]

Fall 2019

August 29, 3:30pm, Wean 8220
Jie Han, University of Rhode Island
Perfect matchings in dense hypergraphs

September 5, 3:30pm, Wean 8220
Joshua Brakensiek, Stanford University
Coded trace reconstruction in a constant number of traces

September 12, 3:30pm, Wean 8220
Gweneth McKinley, Massachusetts Institute of Technology
Super-logarithmic cliques in dense inhomogeneous random graphs

September 19, 3:30pm, Wean 8220
Danny Nguyen, University of Michigan
Integer points in irrational polyhedra and an extension of Presburger Arithmetic

September 26, 3:30pm, Wean 8220
Andrey Kupavskii, University of Oxford
Simple juntas for shifted families

October 3, 3:30pm, Wean 8220
Prasad Tetali, Georgia Institute of Technology
Counting independent sets in graphs and hypergraphs

October 10, 3:30pm, Wean 8220
Mozhgan Mirzaei, University of California, San Diego
Extremal configurations in point-line arrangements

October 17, 3:30pm, Wean 8220
Ruth Luo, University of California, San Diego
Super-pancyclic hypergraphs and bipartite graphs

October 18, 4:30pm, Wean 8220 (note unusual day and time: Friday, 4:30pm)
Travis Morrison, Pennsylvania State University
Post-quantum cryptography and elliptic curves

October 23, Colloquium, 4:30pm, Wean 8220
Thomas Hales, University of Pittsburgh
The formalization of mathematics

October 24, 3:30pm, Wean 8220
Luke Postle, University of Waterloo
Linear-time and efficient distributed algorithms for list-coloring graphs on surfaces

October 25, 4:30pm, Wean 8220 (note unusual day and time: Friday, 4:30pm)
Kate Lorenzen, Iowa State University
Cospectrality and the distance Laplacian

October 28, 3:30pm, Wean 8220 (note unusual day: Monday)
Jo Ellis-Monaghan, Saint Michael's College/Carnegie Mellon University
Combinatorial, topological, and computational approaches to DNA self-assembly

October 31, 3:30pm, Wean 8220
Xavier Pérez Giménez, University of Nebraska–Lincoln
The chromatic number of a random lift of \(K_d\)

November 1, Colloquium, 4:30pm, Wean 8220
David Nualart, University of Kansas
Malliavin calculus and central limit theorems

November 7, 3:30pm, Wean 7218 (note the room change)
Jakub Opršal, Durham University
Topology in computational complexity of graph colouring problems

November 14, 3:30pm, Wean 8220
Christopher Cox, Carnegie Mellon University
Periodic words, common subsequences and frogs

November 15, Joint PITT–CMU Colloquium, 3:30pm, Auditorium of Frick Fine Arts building (Pitt)
Benson Farb, University of Chicago
Resolvent degree, polynomials, and Hilbert's 13th problem

November 21, 3:30pm, Wean 8220
Shira Zerbib, Iowa State University
Tuza's conjecture: a generalization and the random case

December 5, 3:30pm, Wean 8220
Debsoumya Chakraborti, Carnegie Mellon University
Minimizing the number of copies of \(K_r\) in a \(K_s\)-saturated graph

December 12, 4:00pm, Wean 8220 (note unusual time: 4:00pm)
Vijay V. Vazirani, University of California, Irvine
Matching is as easy as the decision problem, in the NC model

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

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

ACO Back to the ACO home page