Video Lectures

I'll describe joint work (in progress) with Ghaith Hiary on implementing and running Hiary's O(t^1/3) algorithm for computing the zeta function and give some highlights of recent computations.

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same order and...