TY  - JOUR
A1  - Casel, Katrin
A1  - Fischbeck, Philipp
A1  - Friedrich, Tobias
A1  - Göbel, Andreas
A1  - Lagodzinski, J. A. Gregor
T1  - Zeros and approximations of Holant polynomials on the complex plane
JF  - Computational complexity : CC
N2  - We present fully polynomial time approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures known as polymers in statistical physics. Our method involves establishing zero-free regions for the partition functions of polymer models and using the most significant terms of the cluster expansion to approximate them. Results of our technique include new approximation and sampling algorithms for a diverse class of Holant polynomials in the low-temperature regime (i.e. small external field) and approximation algorithms for general Holant problems with small signature weights. Additionally, we give randomised approximation and sampling algorithms with faster running times for more restrictive classes. Finally, we improve the known zero-free regions for a perfect matching polynomial.
KW  - Holant problems
KW  - approximate counting
KW  - partition functions
KW  - graph
KW  - polynomials
Y1  - 2022
U6  - https://doi.org/10.1007/s00037-022-00226-5
SN  - 1016-3328
SN  - 1420-8954
VL  - 31
IS  - 2
PB  - Springer
CY  - Basel
ER  -