Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
From MaRDI portal
Publication:6343793
DOI10.1017/fms.2022.4zbMath1533.68102arXiv2006.14828MaRDI QIDQ6343793
Viresh Patel, Andreas Galanis, Guus Regts, Pjotr Buys
Publication date: 26 June 2020
Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs