Fixed-color Potts partition recursion
ProvedZeroFreeRRG.Hardcore.potts_partial_vertex_recursionFor a vertex outside the fixed set, the restricted Potts partition sum is the sum of the restricted sums obtained by assigning each possible color to that vertex.
Preamble
import Mathlib import Definitions.Def_ZeroFreeRRG_Hardcore_PottsPartial set_option autoImplicit false open ZeroFreeRRG.Hardcore open scoped Classical BigOperators
Formal statement
theorem ZeroFreeRRG.Hardcore.potts_partial_vertex_recursion {V : Type} [Fintype V] (q : ℕ) (G : SimpleGraph V)
(β : ℂ) (S : Finset V) (τ : V → Fin q) (v : V) (hv : v ∉ S) :
pottsPartialZ q G β S τ = ∑ c : Fin q, pottsPartialZ q G β (insert v S) (Function.update τ v c) := by sorrySource
Auxiliary step 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.