Ising-Potts Modeles and Matiyasevich's Theorem on Chromatic and Flow Polynomials

Read full text
Authors: Anton Aleksandrovich Kazakov
Cited by: 0

Abstract

We discuss the combinatorial properties of generalized Ising-Potts models within the framework of Biggs's interaction models. We demonstrate that the partition function of this generalized model satisfies the deletion-contraction relation and can be expressed in terms of Tutte-Grothendieck invariants. By combining these results with an analogue of the high-temperature expansion for the classical Ising model, we provide a sketch of a simple proof of Matiyasevich's theorem on chromatic and flow polynomials. Furthermore, we present a sketch of a proof of the inverse to Matiyasevich's theorem.

Fields of Study & Subjects

Advanced Combinatorial Mathematics Algebraic structures and combinatorial models Markov Chains and Monte Carlo Methods

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
3 January 2026
Language
EN