Approximating real-rooted and stable polynomials, with combinatorial applications

zbMath1434.26030arXiv1806.07404MaRDI QIDQ5216314

Alexander I. Barvinok

Publication date: 17 February 2020

Full work available at URL: https://arxiv.org/abs/1806.07404

zbMATH Keywords

approximationsubgraph countingstable polynomialsreal rooted polynomials

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Asymptotic enumeration (05A16)

Related Items

Absence of zeros implies strong spatial mixing, Smoothed counting of 0–1 points in polyhedra, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Correlation decay and the absence of zeros property of partition functions, More on zeros and approximation of the Ising partition function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorics and complexity of partition functions
• The roots of the independence polynomial of a clawfree graph
• Weighted enumeration of spanning subgraphs with degree constraints
• Approximate inclusion-exclusion
• Random matchings in regular graphs
• Counting unbranched subgraphs
• Zeros of graph-counting polynomials
• Inclusion-exclusion: exact and approximate
• Completely analytical interactions: Constructive description
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• Theory of monomer-dimer systems
• Approximating the Permanent
• On the theory of the matching polynomial
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• Christoffel–Darboux Type Identities for the Independence Polynomial
• Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model