![Counting Complexity and Phase Transitions_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Counting%20Complexity%20and%20Phase%20Transitions_hi-res.jpg?h=bf33d09a&itok=MrH5eN5T)
Abstract
I will describe some recent observations related to the calculation of the Ising partition function, or equivalently the enumeration of the edge-cuts of graphs. In particular I will discuss geometric representation of binary linear codes, 4-dimensional discrete Ihara-Selberg function and relation with the 3-dimensional Ising and dimer problems, and complexity of the Max-Cut problem for embedded graphs.