Characterizing partition functions of the spin model by rank growth

2012/09/23 by Schrijver, Alexander
#05C25 #05Exx #82B20 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1209.5044

Abstract

We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.

Related

• Characterizing partition functions of the edge-coloring model by rank\n growth
• Mixed partition functions and exponentially bounded edge-connection rank
• Bounding the partition function of spin-systems
• Characterizing partition functions of the vertex model
• Mixed partition functions are exactly the graph parameters of exponentially bounded edge-connection rank