Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
From MaRDI portal
Publication:2722657
zbMath0999.82022arXivcond-mat/9904146MaRDI QIDQ2722657
Publication date: 3 March 2002
Full work available at URL: https://arxiv.org/abs/cond-mat/9904146
zeroschromatic polynomialpolymer gasuniversal constantsDobrushin-Kotecký-Preiss conditiongeneralized (multivariate) Brown Colbourn conjectureloopless graphsPotts-model partition functionWhitney-Tutte-Fortuin-Kasteleyn representation
Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Exactly solvable models; Bethe ansatz (82B23) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Coloring of graphs and hypergraphs (05C15)
Related Items (66)
On the roots of domination polynomial of graphs ⋮ Convergence of Mayer and Virial expansions and the Penrose tree-graph identity ⋮ On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs ⋮ The Grassmann-Berezin calculus and theorems of the matrix-tree type ⋮ A note on the shameful conjecture ⋮ Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs ⋮ Clustering bounds on \(n\)-point correlations for unbounded spin systems ⋮ Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs ⋮ Analyticity and mixing properties for random cluster model with \(q >0\) on \(\mathbb Z^{ d }\) ⋮ On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ Erratum and addendum: ``Abstract polymer models with general pair interactions ⋮ Continuous particles in the canonical ensemble as an abstract polymer gas ⋮ The Brown-Colbourn conjecture on zeros of reliability polynomials is false ⋮ Maximum modulus of independence roots of graphs and trees ⋮ Counting 2-connected deletion-minors of binary matroids ⋮ Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence ⋮ Absence of zeros implies strong spatial mixing ⋮ Network reliability: Heading out on the highway ⋮ Benjamini-Schramm continuity of root moments of graph polynomials ⋮ Two remarks on the adjoint polynomial ⋮ Improved bounds on coloring of graphs ⋮ Approximating the chromatic polynomial is as hard as computing it exactly ⋮ On the Real Roots of Domination Polynomials ⋮ Generating functions and counting formulas for spanning trees and forests in hypergraphs ⋮ Measures of spin ordering in the Potts model with a generalized external magnetic field ⋮ On the Potts model partition function in an external field ⋮ Graphs of large chromatic number ⋮ On Brenti's conjecture about the log-concavity of the chromatic polynomial ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions ⋮ On the roots of edge cover polynomials of graphs ⋮ The Potts model and chromatic functions of graphs ⋮ Algebraic methods for chromatic polynomials. ⋮ A note on the real part of complex chromatic roots ⋮ Graphs whose certain polynomials have few distinct roots ⋮ Homogeneous multivariate polynomials with the half-plane property ⋮ Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros ⋮ Cluster expansion for abstract polymer models. New bounds from an old approach ⋮ Zeros of Jones polynomials of graphs ⋮ Distribution of coefficients of rank polynomials for random sparse graphs ⋮ A MacWilliams type identity for matroids ⋮ Abstract polymer models with general pair interactions ⋮ A proof of the upper matching conjecture for large graphs ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ Chromatic roots and limits of dense graphs ⋮ Exact chromatic polynomials for toroidal chains of complete graphs ⋮ A little statistical mechanics for the graph theorist ⋮ On the convergence of cluster expansions for polymer gases ⋮ Polynomials with the half-plane property and the support theorems ⋮ A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model ⋮ A logician's view of graph polynomials ⋮ Zeros of Jones polynomials for families of knots and links ⋮ The Tutte-Potts connection in the presence of an external magnetic field ⋮ On the roots of strongly connected reliability polynomials ⋮ On the roots of Wiener polynomials of graphs ⋮ A generalized Beraha conjecture for non-planar graphs ⋮ On the location of roots of graph polynomials ⋮ Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic ⋮ Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems ⋮ Absence of phase transitions in a class of integer spin systems ⋮ Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids ⋮ A matrix method for chromatic polynomials ⋮ Chromatic polynomials and representations of the symmetric group ⋮ Characteristic power series of graph limits ⋮ New bounds for chromatic polynomials and chromatic roots ⋮ Partition function zeros at first-order phase transitions: a general analysis
This page was built for publication: Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
