ACO The ACO Seminar (2020–2021)

Fall 2020

Zoom link for ACO seminars: Please email Boris Bukh (bbukh at math) for a password.

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

September 10, 3:30pm,
Boris Bukh, Carnegie Mellon University
Words and their subsequences

September 17, 3:30pm,
Alan Frieze, Carnegie Mellon University
Expected values in combinatorial optimization

September 24, 3:30pm,
Sai Sandeep Pallerla, Carnegie Mellon University
An Algorithmic Study of the Hypergraph Turan Problem

October 1, 3:30pm,
Ting-Wei Chao, Carnegie Mellon University
Point sets in $\mathbb{R}^d$ without convex $k$-holes

October 8, 3:30pm,
Tomasz Tkocz, Carnegie Mellon University
Khinchin inequalities with sharp constants

October 15, 3:30pm,
Kaave Hosseini, Carnegie Mellon University
Signrank vs Discrepancy

October 22, 3:30pm,
Matt Superdock, Carnegie Mellon University
The necklace splitting problem and robot motion planning

October 29, 3:30pm,
Nóra Frankl, Carnegie Mellon University and London School of Economics
VC-saturated set systems

November 5, 3:30pm,
Florian Frick, Carnegie Mellon University
The topological Tverberg problem beyond prime powers

November 19, 3:30pm,
Santosh Vempala, Georgia Tech
Solving Sparse Linear Systems Faster than Matrix Multiplication

December 3, 3:30pm,
Andrew Newman, CMU
Randomized construction of complexes with large diameter

December 10, 3:30pm,
Jeffrey Zhang, CMU
On Local Minima in Polynomial Optimization

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

ACO Back to the ACO home page