August 29, 3:30pm, Wean 8220

Jie Han, University of Rhode Island

Perfect matchings in dense hypergraphs

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

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

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

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

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

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

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

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

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

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

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

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

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\)

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

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

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

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

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

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

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

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**:
Anton Bernshteyn (abernsht ~at~ math.cmu.edu).

Subscribe to the ACO seminar mailing list.