For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.
On March 27-28 2025, Guus Regts and Ferenc Bencs are organizing a workshop on the Combinatorial, Algorithmic and Probabilistic aspects of Partition Functions.
Event details of Workshop on the Combinatorial, Algorithmic and Probabilistic aspects of Partition Functions
Start date
27 March 2025
End date
28 March 2025

The study of partition functions and related topics is an active area of research that is at the intersection of combinatorics, probability, theoretical computer science, and statistical physics. Partition functions, such as those of the Potts model, the hardcore model (also known as the independence polynomial), and other spin systems, serve as fundamental tools in understanding phase transitions, random structures, and computational complexity.

Central questions in this field include: How does graph structure influence the efficient computation of partition functions? Which graphs maximize or minimize these functions? How do partition functions behave on random graphs? Recent work has highlighted deep connections between phase transitions in statistical physics and the computational aspects of these problems. This workshop aims to bring together researchers from diverse backgrounds to explore these questions, share insights, and foster collaboration on the latest advances in partition functions, graph theory, and related areas.