Potts partition sum with fixed vertex colors
DefinitionZeroFreeRRG_Hardcore_PottsPartialFor a finite graph and a prescribed partial coloring on , this is the sum of over all full colorings extending that prescription.
Definition code
import Definitions.Def_ZeroFreeRRG_Hardcore_Models
import Mathlib
open scoped Classical BigOperators
namespace ZeroFreeRRG.Hardcore
/-- Potts partition sum restricted to colorings matching an assignment on a finite set. -/
noncomputable def pottsPartialZ {V : Type} [Fintype V] (q : ℕ) (G : SimpleGraph V)
(β : ℂ) (S : Finset V) (τ : V → Fin q) : ℂ :=
∑ σ : V → Fin q, if ∀ v ∈ S, σ v = τ v then β ^ monoEdges G σ else 0
end ZeroFreeRRG.Hardcore
Source
Auxiliary definition for Chen–Wang–Zhang, Zero-Freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/1461.pdf, Lemma 5.7.