PreprintCC BY 4.0HAL
On the intractability of approximating the antiferromagnetic Ising model
Abstract
The problem of approximating the partition function of zerofield, antiferromagnetic Ising model in neighborhoods of its complex roots is considered. We demonstrate that the computational intractability of the problem is a consequence of the limitations of inductive inference and the conservation of complexity. Any solution to the problem would require the representation of an extensive amount of information and ensures its intractability.
Related
- Phase transition in the antiferromagnetic Ising model with external field
- On Zeros and Algorithms for Disordered Systems II: The Antiferromagnetic Ising Model up to Kesten-Stigum
- Approximating Distributions on Vertex Degrees in Random Hypergraphs via Stein's Method
- Approximating Pi (and other constants) by Radicals in the Footsteps of Rabbi Abraham Ibn Ezra and Guru RSJ Reddy
- Approximating $1$ by Sums of Unit Fractions
BibTeX
@misc{viles2026intractability,
title = {{On the intractability of approximating the antiferromagnetic Ising model}},
author = {Weston D Viles},
howpublished = {HAL},
year = {2026},
month = sep,
url = {https://hal.science/hal-05746136v1},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On the intractability of approximating the antiferromagnetic Ising model
AU - Weston D Viles
PY - 2026
DA - 2026/09/10
PB - HAL
UR - https://hal.science/hal-05746136v1
AB - The problem of approximating the partition function of zerofield, antiferromagnetic Ising model in neighborhoods of its complex roots is considered. We demonstrate that the computational intractability of the problem is a consequence of the limitations of inductive inference and the conservation of complexity. Any solution to the problem would require the representation of an extensive amount of information and ensures its intractability.
ER -