Zeros of graph-counting polynomials

DOI10.1007/s002200050522zbMath0917.05074OpenAlexW2004919109MaRDI QIDQ1284085

David Pierre Ruelle

Publication date: 11 August 1999

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002200050522

zbMATH Keywords

symmetric polynomialslocation of zerosgraph-counting polynomials

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (9)

Approximating real-rooted and stable polynomials, with combinatorial applications ⋮ The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability ⋮ Graph-counting polynomials for oriented graphs ⋮ Zero-freeness and approximation of real Boolean Holant problems ⋮ The planar limit of \(\mathcal{N} = 2\) superconformal quiver theories ⋮ About David Ruelle, after his 80th birthday ⋮ Weighted enumeration of spanning subgraphs with degree constraints ⋮ The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications ⋮ Location of the Lee-Yang zeros and absence of phase transitions in some Ising spin systems

This page was built for publication: Zeros of graph-counting polynomials