Algorithmic and Combinatorial Aspects of Partition Functions
This is a two-day workshop. The aim of the workshop is to bring together researchers working on different aspects of partition functions in order to exchange ideas and learn about new developments.
The study of various types of partition functions is a very active area of research and lies at the interface of combinatorics, probability, theoretical computer science, and statistical physics. The partition function of the Potts model and the hardcore model, also known as the Tutte polynomial and the independence polynomial respectively are prototypical examples. Some of the fundamental questions in this area include: What sort of network structure allows for efficient computation of the partition function? Which network structures maximizes/minimizes the partition function? How does the partition function of a random network behave? Recent developments have shown strong connections between phase transitions in statistical physics and answers to these type of questions.
The workshop will be organised by Viresh Patel and Guus Regts.
Science Park 904
Science Park 904 | 1098 XH AmsterdamGo to detailpage
+31 (0)20 525 8626