Meeting 15.1: Students talks

Justin talks about the computational complexity of approximating Cheeger constants of graphs, and the relation of this problem to quantum algorithms for persistent homology.  Hans gives an overview of the structure of 3-manifolds.