On a conjecture of Sokal concerning roots of the independence polynomial
From MaRDI portal
Publication:2286792
DOI10.1307/mmj/1541667626zbMath1433.05164arXiv1701.08049OpenAlexW2963400600WikidataQ122941646 ScholiaQ122941646MaRDI QIDQ2286792
Publication date: 22 January 2020
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.08049
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)
Related Items (30)
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs ⋮ Chromatic zeros on hierarchical lattices and equidistribution on parameter space ⋮ The complexity of approximating the complex-valued Potts model ⋮ Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction ⋮ Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs ⋮ Lee-Yang zeros of the antiferromagnetic Ising model ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ Algorithmic Pirogov-Sinai theory ⋮ Absence of zeros implies strong spatial mixing ⋮ Correlation decay and the absence of zeros property of partition functions ⋮ Approximating the chromatic polynomial is as hard as computing it exactly ⋮ On the location of chromatic zeros of series-parallel graphs ⋮ Unnamed Item ⋮ Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials ⋮ Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial ⋮ Analyticity for classical gasses via recursion ⋮ Inapproximability of the Independent Set Polynomial in the Complex Plane ⋮ Location of zeros for the partition function of the Ising model on bounded degree graphs ⋮ Cayley trees do not determine the maximal zero-free locus of the independence polynomial ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fisher zeros and correlation decay in the Ising model ⋮ Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems ⋮ Computing permanents of complex diagonally dominant matrices and tensors ⋮ The interaction light cone of the discrete Bak-Sneppen, contact and other local processes ⋮ The complexity of approximating the complex-valued Potts model ⋮ Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model ⋮ The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs ⋮ Polymer dynamics via cliques: new conditions for approximations ⋮ Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the permanent of (some) complex matrices
- Correlation decay and deterministic FPTAS for counting colorings of a graph
- Counting in two-spin models on \(d\)-regular graphs
- Combinatorics and complexity of partition functions
- Lee-Yang zeros for the DHL and 2D rational dynamics. I: Foliation of the physical cylinder
- Computing the partition function for graph homomorphisms
- The roots of the independence polynomial of a clawfree graph
- Computing the partition function for graph homomorphisms with multiplicities
- On a problem of Spencer
- Zero-free regions of partition functions with applications to algorithms and graph limits
- Lee-Yang-Fisher zeros for the DHL and 2D rational dynamics. II: Global pluripotential interpretation
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models
- Improved FPTAS for Multi-spin Systems
- Counting independent sets up to the tree threshold
- FPTAS for #BIS with Degree Bounds on One Side
- Computing the partition function for cliques in a graph
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Approximating permanents and hafnians
- Inapproximability of the independent set polynomial in the complex plane
- Dynamics in One Complex Variable. (AM-160)
This page was built for publication: On a conjecture of Sokal concerning roots of the independence polynomial
