Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

DOI10.5555/3458064.3458155MaRDI QIDQ6147346zbMATH OpenFDO

Authors Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts

Publication date 15 January 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
• The Ising partition function: zeros and deterministic approximation
• The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
• Lee-Yang theorems and the complexity of computing averages
• Location of zeros for the partition function of the Ising model on bounded degree graphs

This page was built for publication: Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147346)