On a conjecture of Sokal concerning roots of the independence polynomial

A conjecture of Sokal (2001) regarding the domain of non-vanishing for independence polynomials of graphs, states that given any natural number $\Delta \ge 3$, there exists a neighborhood in $\mathbb C$ of the interval $[0, \frac{(\Delta-1)^{\Delta-1}}{(\Delta-2)^{\Delta}})$ on which the independence polynomial of any graph with maximum degree at most $\Delta$ does not vanish. We show here that Sokal's Conjecture holds, as well as a multivariate version, and prove optimality for the domain of non-vanishing. An important step is to translate the setting to the language of complex dynamical systems.

[1]  Dmitriy Katz,et al.  Correlation decay and deterministic FPTAS for counting colorings of a graph , 2012, J. Discrete Algorithms.

[2]  Viresh Patel,et al.  Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials , 2016, Electron. Notes Discret. Math..

[3]  Pinyan Lu,et al.  Improved FPTAS for Multi-spin Systems , 2013, APPROX-RANDOM.

[4]  Alexander I. Barvinok,et al.  Computing the partition function for graph homomorphisms , 2014, Comb..

[5]  P. Alam.  ‘A’ , 2021, Composites Engineering: An A–Z Guide.

[6]  A. Scott,et al.  The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma , 2003, cond-mat/0309352.

[7]  Klaus Jansen,et al.  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , 2012, Lecture Notes in Computer Science.

[8]  Guus Regts.  Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits , 2018, Comb..

[9]  Allan Sly,et al.  Counting in two-spin models on d-regular graphs , 2014 .

[10]  Leslie Ann Goldberg,et al.  Inapproximability of the Independent Set Polynomial Below the Shearer Threshold , 2017, ICALP.

[11]  J. Milnor.  Dynamics in one complex variable , 2000 .

[12]  Ivona Bezáková,et al.  Inapproximability of the independent set polynomial in the complex plane , 2017, STOC.

[13]  LEE-YANG-FISHER.  LEE-YANG-FISHER ZEROS FOR THE DHL AND 2D RATIONAL DYNAMICS, , 2018 .

[14]  Alan D. Sokal.  A Personal List of Unsolved Problems Concerning Lattice Gases and Antiferromagnetic Potts Models , 2000 .

[15]  Dror Weitz,et al.  Counting independent sets up to the tree threshold , 2006, STOC '06.

[16]  Pavel Bleher,et al.  Lee–Yang–Fisher Zeros for the DHL and 2D Rational Dynamics, II. Global Pluripotential Interpretation , 2011, The Journal of Geometric Analysis.

[17]  M. Lyubich,et al.  ZEROS FOR DHL AND 2 D RATIONAL DYNAMICS , , 2011 .

[18]  Alexander I. Barvinok,et al.  Computing the partition function for graph homomorphisms with multiplicities , 2016, J. Comb. Theory, Ser. A.

[19]  Paul D. Seymour,et al.  The roots of the independence polynomial of a clawfree graph , 2007, J. Comb. Theory B.

[20]  Alexander I. Barvinok,et al.  Computing the Partition Function for Cliques in a Graph , 2014, Theory Comput..

[21]  Alexander I. Barvinok,et al.  Combinatorics and Complexity of Partition Functions , 2017, Algorithms and combinatorics.

[22]  FPTAS for #BIS with Degree Bounds on One Side , 2014, STOC.

[23]  Alexander I. Barvinok.  Approximating permanents and hafnians of positive matrices , 2016, ArXiv.

[24]  Alexander Barvinok,et al.  Approximating permanents and hafnians , 2016, 1601.07518.

[25]  James B. Shearer,et al.  On a problem of spencer , 1985, Comb..

[26]  Alexander I. Barvinok,et al.  Computing the Permanent of (Some) Complex Matrices , 2014, Foundations of Computational Mathematics.

[27]  Dmitriy Katz,et al.  Correlation decay and deterministic FPTAS for counting list-colorings of a graph , 2007, SODA '07.

[28]  David Gamarnik,et al.  Simple deterministic approximation algorithms for counting matchings , 2007, STOC '07.

[29]  Pavel Bleher,et al.  Lee-Yang zeros for DHL and 2D rational dynamics, I. Foliation of the physical cylinder , 2010, 1009.4691.