In this talk I will show how one can use the methodology of spectral bounds and SDP hierarchies, which were originally developed for optimization problems on finite graphs, to special classes of infinite graphs. The infinite graphs I am considering possess a lot of geometric structure and so tools from harmonic analysis can be used in proofs and in explicit computations. For many classical packing problems in discrete geometry this approach gives the best known results.

Video Recording