A Deterministic Algorithm for Counting Colorings with 2Δ Colors

Explore a deterministic algorithm for counting colorings with 2Δ colors in this 22-minute IEEE conference talk. Delve into the intricacies of Q-Coloring, randomized algorithms, and phase transitions. Examine concepts such as partition functions, dominos interpolation, and zero-free regions. Gain insights into triangle-free regions, entropy conditions, and the main ideas behind this innovative approach. Learn from speakers Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava as they present their findings and recap the key points of this advanced mathematical topic.