Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T09:44:25.369Z Has data issue: false hasContentIssue false

More on zeros and approximation of the Ising partition function

Published online by Cambridge University Press:  07 June 2021

Alexander Barvinok
Affiliation:
Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1043, USA; E-mail: barvinok@umich.edu
Nicholas Barvinok
Affiliation:
School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332, USA; E-mail: nbarvinok3@gatech.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider the problem of computing the partition function $\sum _x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\mathbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial f, we show that the partition function can be approximated within relative error $0 < \epsilon < 1$ in quasi-polynomial $n^{O(\ln n - \ln \epsilon )}$ time if the Lipschitz constant of the non-linear part of f with respect to the $\ell ^1$ metric on the Boolean cube does not exceed $1-\delta $, for any $\delta>0$, fixed in advance. For a cubic polynomial f, we get the same result under a somewhat stronger condition. We apply the method of polynomial interpolation, for which we prove that $\sum _x e^{\tilde {f}(x)} \ne 0$ for complex-valued polynomials $\tilde {f}$ in a neighborhood of a real-valued f satisfying the above mentioned conditions. The bounds are asymptotically optimal. Results on the zero-free region are interpreted as the absence of a phase transition in the Lee–Yang sense in the corresponding Ising model. The novel feature of the bounds is that they control the total interaction of each vertex but not every single interaction of sets of vertices.

Information

Type
Discrete Mathematics
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press