Cayley trees do not determine the maximal zero-free locus of the independence polynomial

DOI10.1307/MMJ/1599206419MaRDI QIDQ2238459zbMATH OpenOpenAlexFDO

Authors Pjotr Buys

Publication date 1 November 2021

Published in Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1307/mmj/1599206419

zbMATH Keywords

occupation ratio of a graphrational maps

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph polynomials (05C31) Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05)

Recommendations

• On a conjecture of Sokal concerning roots of the independence polynomial
• Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree
• The roots of the independence polynomial of a clawfree graph
• Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
• Bounding the roots of independence polynomials.

Cites work

• A personal list of unsolved problems concerning lattice gases and antiferromagnetic Potts models
• Combinatorics and complexity of partition functions
• Counting independent sets up to the tree threshold
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Inapproximability of the independent set polynomial in the complex plane
• On a conjecture of Sokal concerning roots of the independence polynomial
• On a problem of Spencer
• On the dynamics of rational maps
• 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
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma

Cited in

(10)

• On a conjecture of Sokal concerning roots of the independence polynomial
• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
• The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
• Absence of zeros implies strong spatial mixing
• Approximating the chromatic polynomial is as hard as computing it exactly
• On the location of chromatic zeros of series-parallel graphs
• Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial
• On the zeroes of hypergraph independence polynomials
• Zero-free regions for the independence polynomial on restricted graph classes
• The limit of the zero locus of the independence polynomial for bounded degree graphs

This page was built for publication: Cayley trees do not determine the maximal zero-free locus of the independence polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238459)