<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body dir="auto"><div dir="ltr"><meta http-equiv="content-type" content="text/html; charset=utf-8"><div dir="ltr"><span>Departments of Mathematics & Computer Science</span><br><span>Combinatorics & Theory Seminar</span><br><span></span><br><span>Tuesday, April 12, 3:30pm</span><br><span>Location Kent 107</span><br><span></span><br><span>Will Perkins (UIC)</span><br><span></span><br><span>TITLE: </span><span style="-webkit-text-size-adjust: auto; font-family: Calibri, sans-serif; font-size: 13.333333015441895px;"><span style="font-size: 16pt;">Sampling, counting, and local central limit theorems</span></span><br><span></span><br><span>ABSTRACT: </span>I will describe how local central limit theorems (and Fourier-analytic proofs of local central limit theorems) can be used to design fast sampling algorithms and deterministic approximate counting algorithms for the number of independent sets and matchings of a given size in bounded degree graphs. </div><div dir="ltr"><br></div><div dir="ltr">Joint work with Vishesh Jain, Ashwin Sah, and Mehtaab Sawhney. </div></div></body></html>