Pages that link to "Item:Q1932470"
From MaRDI portal
The following pages link to Complex zero-free regions at large \(|q|\) for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights (Q1932470):
Displayed 19 items.
- Continuous particles in the canonical ensemble as an abstract polymer gas (Q358671) (← links)
- Zeros of Jones polynomials of graphs (Q490409) (← links)
- Topological graph polynomials in colored group field theory (Q625725) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with extra-vertex boundary conditions (Q648130) (← links)
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
- On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs (Q824265) (← links)
- Chromatic zeros on hierarchical lattices and equidistribution on parameter space (Q824267) (← links)
- Benjamini-Schramm continuity of root moments of graph polynomials (Q896079) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- On the convergence of cluster expansions for polymer gases (Q976849) (← links)
- Absence of phase transitions in a class of integer spin systems (Q1035820) (← links)
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044) (← links)
- Zero-free regions of partition functions with applications to algorithms and graph limits (Q1786055) (← links)
- Convergence of cluster and virial expansions for repulsive classical gases (Q2175124) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial (Q2391044) (← links)
- Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros (Q3295936) (← links)
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs (Q3449868) (← links)
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
- Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)