Beyond windability: approximability of the four-vertex model

DOI10.1016/J.TCS.2024.114491OpenAlexW4392520315MaRDI QIDQ6204549FDOQ6204549

Authors Tianyu Liu, Xiongxin Yang

Publication date 28 March 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2024.114491

zbMATH Keywords

MCMCapproximate countingfour-vertex modelwindability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Approximability of the Six-vertex Model
• Approximating the partition function of planar two-state spin systems
• Inapproximability of the Tutte polynomial of a planar graph
• Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
• Inapproximability after uniqueness phase transition in two-spin systems

Cites work

• scientific article; zbMATH DE number 7221274 (Why is no real title available?)
• scientific article; zbMATH DE number 3856167 (Why is no real title available?)
• scientific article; zbMATH DE number 1750693 (Why is no real title available?)
• scientific article; zbMATH DE number 892258 (Why is no real title available?)
• scientific article; zbMATH DE number 6472600 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• scientific article; zbMATH DE number 7650104 (Why is no real title available?)
• A Contribution to the Theory of Chromatic Polynomials
• Approximability of the Six-vertex Model
• Approximately sampling elements with fixed rank in graded posets
• Canonical Paths for MCMC: from Art to Science
• Complexity classification of the six-vertex model
• Computational complexity of Holant problems
• Dimer problem in statistical mechanics-an exact result
• Euler and bipartite matroids
• Four-vertex model and random tilings
• Integrable models and combinatorics
• Markov chain algorithms for planar lattice structures
• On the evaluation at (3,3) of the Tutte polynomial of a graph
• On the number of Eulerian orientations of a graph
• Partition function of the eight-vertex lattice model
• Polynomial-Time Approximation Algorithms for the Ising Model
• Random cluster dynamics for the Ising model is rapidly mixing
• Random generation of combinatorial structures from a uniform distribution
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• The worm process for the Ising model is rapidly mixing

This page was built for publication: Beyond windability: approximability of the four-vertex model

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