The purpose of this seminar is to develop polynomial-time algorithms for the problem of uniform sampling hypergraph colorings. Generating a proper q-coloring uniformly at random is a well studied problem in computer science and statistical physics. With this project we intend to use a block dynamics Markov chain Monte Carlo approach to develop new algorithms for this problem.
