Lee-Yang theorems and the complexity of computing averages
From MaRDI portal
Publication:2249768
DOI10.1007/s00220-014-2036-7zbMath1294.82009OpenAlexW2570168223MaRDI QIDQ2249768
Alistair Sinclair, Piyush Srivastava
Publication date: 3 July 2014
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00220-014-2036-7
Statistical mechanics of polymers (82D60) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Statistical mechanics of magnetic materials (82D40)
Related Items
The Ising partition function: zeros and deterministic approximation, The worm process for the Ising model is rapidly mixing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- The GHS inequality and the Riemann hypothesis
- Partition function zeros at first-order phase transitions: a general analysis
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- The roots of the independence polynomial of a clawfree graph
- Random generation of combinatorial structures from a uniform distribution
- Homogeneous multivariate polynomials with the half-plane property
- PRIMES is in P
- Partition function zeros at first-order phase transitions: Pirogov-Sinai theory
- Pólya-Schur master theorems for circular domains and their boundaries
- Theory of monomer-dimer systems
- The complexity of partition functions
- Counting independent sets up to the tree threshold
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions
- Existence and Uniqueness of Interpolating Rational Functions
- The Complexity of Enumeration and Reliability Problems
- The computational complexity of two‐state spin systems
- Synthesis of a Finite Two-terminal Network whose Driving-point Impedance is a Prescribed Function of Frequency
- Reducibility among Combinatorial Problems
- Computational Complexity
- Paths, Trees, and Flowers
- A Complexity Dichotomy for Partition Functions with Mixed Signs
- Complexity of counting CSP with complex weights
- Systems of distinct representatives and linear algebra
- The complexity of theorem-proving procedures
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- Zeros of the partition function for generalized ising systems
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem
