The complexity of approximating the complex-valued Potts model

DOI10.4230/LIPIcs.MFCS.2020.36OpenAlexW3082899220MaRDI QIDQ5089203

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

Publication date: 18 July 2022

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

zbMATH Keywords

partition functionPotts modelTutte polynomialcomplex numbersapproximate counting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inapproximability of the Tutte polynomial
• A spanning tree expansion of the Jones polynomial
• The complexity of approximating complex-valued Ising and Tutte partition functions
• The Ising partition function: zeros and deterministic approximation
• On the chromatic roots of generalized theta graphs
• Inapproximability of the Tutte polynomial of a planar graph
• On a conjecture of Sokal concerning roots of the independence polynomial
• Theory of monomer-dimer systems
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Polynomial-Time Approximation Algorithms for the Ising Model
• Approximating the Partition Function of the Ferromagnetic Potts Model
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Graph Classes: A Survey
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• On the computational complexity of the Jones and Tutte polynomials
• Introduction to Dynamical Systems
• The Complexity of Computing the Sign of the Tutte Polynomial
• Zeros of ferromagnetic 2-spin systems
• Fisher zeros and correlation decay in the Ising model
• Weighted counting of solutions to sparse systems of equations
• Inapproximability of the independent set polynomial in the complex plane
• Zeros of Holant problems: locations and algorithms
• The Computational Complexity of Tutte Invariants for Planar Graphs
• Approximate Counting and Quantum Computation
• 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

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