Workshops

Spring 2019

Deterministic Counting, Probability, and Zeros of Partition Functions

Mar 18, 2019 to Mar 22, 2019

Return to event »

Click on the titles of individual talks for abstract, slides and archived video.

Monday, March 18th, 2019
9:00 am – 9:20 am		Coffee and Check-In
9:20 am – 9:30 am		Opening Remarks
9:30 am – 10:15 am		Reflection Positivity as Complement to the Location of Zeros of Partition Functions Elliott Lieb (Princeton University)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Computation of the Multivariate Independence Polynomial by Correlation Decay Jan Vondrák (Stanford University)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		Inapproximability of the Independent Set Polynomial in the Complex Plane Ivona Bezáková (Rochester Institute of Technology)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		Deterministic Approximation of the Ising Partition Function Piyush Srivastava (Tata Institute of Fundamental Research)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break
3:30 pm – 4:15 pm		The Six- and the Eight-vertex Models and Counting Perfect Matchings Tianyu Liu (University of Wisconsin-Madison)
4:15 pm – 4:30 pm		Questions/Discussion
4:30 pm – 6:00 pm		Welcome Reception

Tuesday, March 19th, 2019
9:00 am – 9:30 am		Coffee and Check-In
9:30 am – 10:15 am		Zeros for Partition Functions and Graph-counting Polynomials. David Ruelle (IHES)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Counting Degree-constrained Subgraphs and Orientations Péter Csikvári (Eötvös Loránd University)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		Entropy, Capacity, and Counting Nisheeth Vishnoi (Yale University)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		Approximating the Permanent of a Random Matrix with Vanishing Mean Saeed Mehraban (Massachusetts Institute of Technology)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break
3:30 pm – 4:15 pm		Counting Matchings via the Capacity Method Jonathan Leake (UC Berkeley)
4:15 pm – 4:30 pm		Questions/Discussion

Wednesday, March 20th, 2019
9:00 am – 9:30 am		Coffee and Check-In
9:30 am – 10:15 am		Zeros of Moment Generating Functions and the Riemann Hypothesis Chuck Newman (NYU)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Approximating the Matching Polynomial Leslie Ann Goldberg (University of Oxford)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		Approximate Deterministic Counting via Marginal Entropy Optimization Nima Anari (Stanford University)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		Zeros of the Partition Function of the Ising Model on Bounded Degree Graphs Guus Regts (University of Amsterdam)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break
3:30 pm – 4:15 pm		A Poly-time Deterministic Algorithm for Simply Exponential Approximation of the Permanent of PSD Matrices and Other Cool Quantum Things Leonid Gurvits (City University of New York)
4:15 pm – 4:30 pm		Questions/Discussion

Thursday, March 21st, 2019
9:00 am – 9:30 am		Coffee and Check-In
9:30 am – 10:15 am		Abstract Polymer Models and the Cluster Expansion Will Perkins (University of Illinois at Chicago)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Counting Independent Sets and Colorings on Almost Every Random Regular Bipartite Graph Pinyan Lu (Shanghai University of Finance and Economics)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		Algorithmic Pirogov-Sinai Theory Tyler Helmuth (University of Bristol)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		Finding Eigenvalues in Exponential Size Space: the RRG Algorithm for 1-Dimensional Gapped Hamiltonians Zeph Landau (UC Berkeley)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break
3:30 pm – 4:15 pm		Gauges, Loops, and Polynomials for Partition Functions of Graphical Models Michael Chertkov (University of Arizona, Tucson)
4:15 pm – 4:30 pm		Questions/Discussion

Friday, March 22nd, 2019
9:00 am – 9:30 am		Coffee and Check-In
9:30 am – 10:15 am		Negative Dependence and Lorentzian Polynomials Petter Brändén (KTH Royal Institute of Technology)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Counting Hypergraph Colorings in the Local Lemma Regime Heng Guo (University of Edinburgh)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		Christoffel-Darboux Type Identities for the Independence Polynomial Ferenc Bencs (Central European University)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		A Combinatorial Approach to Complexity Transitions in Quantum Physics Ryan Mann (University of Technology Sydney)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break / End of Workshop