Department of Mathematical SciencesEvents People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department Alumni
Algorithms, Combinatorics and Optimization Seminar
Title: Counting solutions to random constraint satisfaction problems
Abstract: Random constraint satisfaction problems encode many interesting questions in random graphs such as the chromatic and independence numbers. Ideas from statistical physics provide a detailed description of phase transitions and properties of these models. I will discuss the question of the number of solutions to random regular NAE-SAT. This involves understanding the condensation regime where the model undergoes what is known as a one step replica symmetry breaking transition. We expect these approaches to extend to a range of other models in the same universality class. Joint with with Nike Sun and Yumeng Zhang.
Date: Friday, February 24, 2017
Time: 4:30 pm
Location: Wean Hall 7500
Note: unusual day/time. Refreshments at 4:00 pm, Wean Hall 6220.