Korteweg-de Vries Institute for Mathematics

Algorithmic and Combinatorial Aspects of Partition Functions

23Aug2018 24Aug2018

Workshop

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.

Topic

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.

Organisers

The workshop will be organised by Viresh Patel and Guus Regts.

Program


Thursday 23 August

  • 09.00 - 09.30 Coffee
  • 09.30 - 09.40 Opening: Eric Opdam
  • 09.40 - 10.30 Alexander Barvinok: The interpolation method and its challenges
  • 10.30 - 11.00 Coffee
  • 11.00 - 11.50 Leslie Goldberg: Computational Complexity and the Independence Polynomial
  • 11.50 - 12.30 Matthew Jenssen
  • 12.30 - 14.00 Lunch
  • 14.00 - 14.50 Han Peters
  • 14.50 - 15.20 Mark Jerrum: Perfect simulation of the Hard Disks Model by Partial Rejection Sampling
  • 15.20 - 15.50 Coffee
  • 15.50 - 16.40 Martin Loebl: Binary Linear Codes via 4D Discrete Ihara-Selberg Function
  • 16.40 - 17.10 Tyler Helmuth: Algorithmic Pirogov-Sinai Theory
  • 18.00              Conference dinner

Friday 24 August

  • 09.00 - 09.30 Coffee
  • 09.30 - 10.20 Amin Coja-Oghlan: Spin systems on Bethe lattices
  • 10.20 - 10.50 Heng Guo: A polynomial-time approximation algorithm for all-terminal network reliability
  • 10.50 - 11.20 Coffee
  • 11.20 - 12.10 Péter Csikvári: Statistical matching theory
  • 12.10 - 12.40 Ferencs Bencs: Christoffel--Darboux type identities for the independence polynomial
  • 12.40 - 14.20 Lunch
  • 14.20 - 14.50 Ewan Davies
  • 14.50 - 15.40 Lex Schrijver
  • 15.40              Drinks and bites

 

Location

  • Science Park 904

    Science Park 904 | 1098 XH Amsterdam
    +31 (0)20 525 8626

    Go to detailpage

Published by  Korteweg de Vries Institute