Extremes of the internal energy of the Potts model on cubic graphs

preprint2017arXivOpen access

Abstract

We prove tight upper and lower bounds on the internal energy per particle (expected number of monochromatic edges per vertex) in the anti-ferromagnetic Potts model on cubic graphs at every temperature and for all q≥2q \ge 2. This immediately implies corresponding tight bounds on the anti-ferromagnetic Potts partition function. Taking the zero-temperature limit gives new results in extremal combinatorics: the number of qq-colorings of a 33-regular graph, for any q≥2q \ge 2, is maximized by a union of K3,3K_{3,3}'s. This proves the d=3d=3 case of a conjecture of Galvin and Tetali.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.