Image
- Click on the titles of individual talks for abstract, slides and archived video.
–
Coffee and Check-In
–
Opening Remarks
–
Reflection Positivity as Complement to the Location of Zeros of Partition Functions
Elliott Lieb (Princeton University)
Elliott Lieb (Princeton University)
–
Questions/Discussion
–
Computation of the Multivariate Independence Polynomial by Correlation Decay
Jan Vondrák (Stanford University)
Jan Vondrák (Stanford University)
–
Questions/Discussion
–
Break
–
Inapproximability of the Independent Set Polynomial in the Complex Plane
Ivona Bezáková (Rochester Institute of Technology)
Ivona Bezáková (Rochester Institute of Technology)
–
Questions/Discussion
–
Lunch
–
Deterministic Approximation of the Ising Partition Function
Piyush Srivastava (Tata Institute of Fundamental Research)
Piyush Srivastava (Tata Institute of Fundamental Research)
–
Questions/Discussion
–
Break
–
The Six- and the Eight-vertex Models and Counting Perfect Matchings
Tianyu Liu (University of Wisconsin-Madison)
Tianyu Liu (University of Wisconsin-Madison)
–
Questions/Discussion
–
Welcome Reception
–
Coffee and Check-In
–
Questions/Discussion
–
Counting Degree-constrained Subgraphs and Orientations
Péter Csikvári (Eötvös Loránd University)
Péter Csikvári (Eötvös Loránd University)
–
Questions/Discussion
–
Break
–
Questions/Discussion
–
Lunch
–
Approximating the Permanent of a Random Matrix with Vanishing Mean
Saeed Mehraban (Massachusetts Institute of Technology)
Saeed Mehraban (Massachusetts Institute of Technology)
–
Questions/Discussion
–
Break
–
Questions/Discussion
–
Coffee and Check-In
–
Questions/Discussion
–
Questions/Discussion
–
Break
–
Approximate Deterministic Counting via Marginal Entropy Optimization
Nima Anari (Stanford University)
Nima Anari (Stanford University)
–
Questions/Discussion
–
Lunch
–
Zeros of the Partition Function of the Ising Model on Bounded Degree Graphs
Guus Regts (University of Amsterdam)
Guus Regts (University of Amsterdam)
–
Questions/Discussion
–
Break
–
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)
Leonid Gurvits (City University of New York)
–
Questions/Discussion
–
Coffee and Check-In
–
Abstract Polymer Models and the Cluster Expansion
Will Perkins (University of Illinois at Chicago)
Will Perkins (University of Illinois at Chicago)
–
Questions/Discussion
–
Counting Independent Sets and Colorings on Almost Every Random Regular Bipartite Graph
Pinyan Lu (Shanghai University of Finance and Economics)
Pinyan Lu (Shanghai University of Finance and Economics)
–
Questions/Discussion
–
Break
–
Questions/Discussion
–
Lunch
–
Finding Eigenvalues in Exponential Size Space: the RRG Algorithm for 1-Dimensional Gapped Hamiltonians
Zeph Landau (UC Berkeley)
Zeph Landau (UC Berkeley)
–
Questions/Discussion
–
Break
–
Gauges, Loops, and Polynomials for Partition Functions of Graphical Models
Michael Chertkov (University of Arizona, Tucson)
Michael Chertkov (University of Arizona, Tucson)
–
Questions/Discussion
–
Coffee and Check-In
–
Negative Dependence and Lorentzian Polynomials
Petter Brändén (KTH Royal Institute of Technology)
Petter Brändén (KTH Royal Institute of Technology)
–
Questions/Discussion
–
Questions/Discussion
–
Break
–
Christoffel-Darboux Type Identities for the Independence Polynomial
Ferenc Bencs (Central European University)
Ferenc Bencs (Central European University)
–
Questions/Discussion
–
Lunch
–
A Combinatorial Approach to Complexity Transitions in Quantum Physics
Ryan Mann (University of Technology Sydney)
Ryan Mann (University of Technology Sydney)
–
Questions/Discussion
–
Break / End of Workshop
Share this page