The complexity of approximating the complex-valued Potts model

DOI10.4230/LIPICS.MFCS.2020.36MaRDI QIDQ5089203zbMATH OpenOpenAlexFDO

Authors Andreas Galanis, Leslie Ann Goldberg, Andrés Herrera-Poyatos

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPIcs.MFCS.2020.36

zbMATH Keywords

approximate countingcomplex numberspartition functionPotts modelTutte polynomial

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The complexity of approximating the complex-valued Potts model
• The complexity of approximating complex-valued Ising and Tutte partition functions
• The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs

Cites work

• A spanning tree expansion of the Jones polynomial
• Approximate Counting and Quantum Computation
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
• Fisher zeros and correlation decay in the Ising model
• Graph Classes: A Survey
• How hard is it to approximate the Jones polynomial?
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 3076589 (Why is no real title available?)
• Inapproximability of the independent set polynomial in the complex plane
• Inapproximability of the Tutte polynomial
• Inapproximability of the Tutte polynomial of a planar graph
• Introduction to Dynamical Systems
• On a conjecture of Sokal concerning roots of the independence polynomial
• On the chromatic roots of generalized theta graphs
• On the computational complexity of the Jones and Tutte polynomials
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Polynomial-Time Approximation Algorithms for the Ising Model
• STATISTICAL MECHANICS OF EQUILIBRIUM AND NONEQUILIBRIUM PHASE TRANSITIONS: THE YANG–LEE FORMALISM
• Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
• The complexity of approximating complex-valued Ising and Tutte partition functions
• The complexity of approximating the matching polynomial in the complex plane
• The complexity of computing the sign of the Tutte polynomial
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Computational Complexity of Tutte Invariants for Planar Graphs
• The Ising partition function: zeros and deterministic approximation
• The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
• Theory of monomer-dimer systems
• Weighted counting of solutions to sparse systems of equations
• Zeros of ferromagnetic 2-spin systems
• Zeros of Holant problems: locations and algorithms

Cited in

(1)

• The complexity of approximating the complex-valued Potts model

This page was built for publication: The complexity of approximating the complex-valued Potts model

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