Workshop on the Combinatorial, Algorithmic and Probabilistic aspects of Partition Functions

Partition functions are fundamental tools in studying phase transitions, random structures, and computational complexity, with applications spanning combinatorics, probability, computer science, and statistical physics. Examples include the Potts model, the hardcore model, and other spin systems. Central questions involve how graph structure impacts the efficient computation of partition functions, which graphs optimize these functions, and their behavior on random graphs. Recent research has uncovered strong connections between statistical physics phase transitions and computational problems. This workshop gathers researchers from various disciplines to explore these topics, share insights, and encourage collaboration.