Zeros and approximations of Holant polynomials on the complex plane
Authors: 
Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor LagodzinskiAuthors Info & Claims
Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Andreas Göbel, J. A. Gregor LagodzinskiAuthors Info & ClaimsAbstract
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.
References
[1]
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi & Viggo Kann (1999). Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer. ISBN 3540654313.
[2]
Miriam Backens (2018). A Complete Dichotomy for Complex-Valued Holantc. In Proceedings of ICALP 2018, 12:1–12:14.
[3]
Alexander Barvinok & Guus Regts (2019). Weighted counting of solutions to sparse systems of equations. Combinatorics, Probability and Computing. 1–24
[4]
Alexander I. Barvinok (2016a). Combinatorics and Complexity of Partition Functions, volume 30 of Algorithms and combinatorics. Springer.
[5]
Alexander I. Barvinok (2016b). Computing the Permanent of (Some) Complex Matrices. Foundations of Computational Mathematics 16(2), 329–342.
[6]
Alexander I. Barvinok (2019). Computing permanents of complex diagonally dominant matrices and tensors. Israel Journal of Mathematics 232(2), 931–945.
[7]
IvonaÁkovÁ, Andreas Galanis, Leslie Ann Goldberg & Daniel Stefankovic (2021). The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory 13(2).
[8]
Bla Bollobs (2006). The Art of Mathematics: Coffee Time in Memphis. Cambridge University Press.
[9]
Christian Borgs, Jennifer T. Chayes, Jeff Kahn & LÁszl´Ó LovÁsz (2013). Left and right convergence of graphs with bounded degree. Random Structures and Algorithms 42(1), 1–28.
[10]
Russ Bubley & Martin Dyer (1997). Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. In Proceedings of SODA 1997, 248–257.
[11]
Jin-Yi Cai, Heng Guo & Tyson Williams (2016a). A Complete Dichotomy Rises from the Capture of Vanishing Signatures. SIAM J. Comput. 45(5), 1671–1728.
[12]
Jin-Yi Cai, Heng Guo & Tyson Williams (2016b). The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems. Research in the Mathematical Sciences 3(1), 1–77.
[13]
Jin-Yi Cai & Tianyu Liu (2020). Counting Perfect Matchings and the Eight-Vertex Model. In Proceedings of ICALP 2020, 23:1–23:18.
[14]
Jin-Yi Cai, Tianyu Liu & Pinyan Lu (2019). Approximability of the Six-vertex Model. In Proceedings of SODA 2019, 2248–2261.
[15]
Jin-yi Cai, Pinyan Lu & Mingji Xia (2011). Computational Complexity of Holant Problems. SIAM J. Comput. 40(4), 1101–1132.
[16]
Jin-Yi Cai, Pinyan Lu & Mingji Xia (2013). Dichotomy for Holant* Problems with Domain Size 3. In Proceedings of SODA 2013, 1278– 1295.
[17]
Jin-Yi Cai, Pinyan Lu & Mingji Xia (2018). Dichotomy for Real Holantc Problems. In Proceedings of SODA 2018, 1802–1821.
[18]
Sarah Cannon & Will Perkins (2020). Counting independent sets in unbalanced bipartite graphs. In Proceedings of SODA 2020, 1456– 1466.
[19]
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart & Eric Vigoda (2021). Fast Algorithms at Low Temperatures via Markov Chains. Random Structures & Algorithms 58(2), 294–321.
[20]
PÉter CsikvÁ ri & Mohammad Reza Oboudi (2011). On the roots of edge cover polynomials of graphs. European Journal of Combinatorics 32(8), 1407 – 1416.
[21]
Martin Dyer & Catherine Greenhill (1999). Random walks on combinatorial objects. In Surveys in Combinatorics 1999, 101–136.
[22]
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill & Mark Jerrum (2004). The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3), 471–500.
[23]
Sacha Friedli & Yvan Velenik (2017). Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction. Cambridge University Press.
[24]
Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda & Linji Yang (2014). Improved inapproximability results for counting independent sets in the hard-core model. Random Structures and Algorithms 45(1), 78–110.
[25]
Christian Gruber & HervÉ Kunz (1971). General properties of polymer systems. Communications in Mathematical Physics 22(2), 133–161.
[26]
Heng Guo, Chao Liao, Pinyan Lu & Chihao Zhang (2021). Zeros of Holant problems: locations and algorithms. ACM Trans. Algorithms 17(1).
[27]
Ole J. Heilmann & Elliott H. Lieb (1972). Theory of Monomer- Dimer systems. Communications in Mathematical Physics 25(3), 190– 232.
[28]
Tyler Helmuth, Will Perkins & Guus Regts (2019). Algorithmic Pirogov-Sinai theory. In Proceedings of STOC 2019, 1009–1020. The referenced version can be found at arxiv.org/abs/1806.11548.
[29]
Lingxiao Huang, Pinyan Lu & Chihao Zhang (2016). Canonical Paths for MCMC: from Art to Science. In Proceedings of SODA 2016, 514–527.
[30]
Matthew Jenssen, Peter Keevash & Will Perkins (2020). Algorithms for #BIS-hard problems on expander graphs. SIAM Journal on Computing 49(4), 681–710.
[31]
Mark Jerrum & Alistair Sinclair (1989). Approximating the Permanent. SIAM J. Comput. 18(6), 1149–1178.
[32]
Mark Jerrum & Alistair Sinclair (1993). Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput. 22(5), 1087–1116.
[33]
Mark Jerrum, Leslie G. Valiant & Vijay V. Vazirani (1986). Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science 43(2-3), 169–188.
[34]
Roman KoteckÝ & David Preiss (1986). Cluster expansion for abstract polymer models. Communications in Mathematical Physics 103(3), 491–498.
[35]
Chao Liao, Jiabao Lin, Pinyan Lu & Zhenyu Mao (2019). Counting Independent Sets and Colorings on Random Regular Bipartite Graphs. In Proceedings of APPROX/RANDOM 2019, 34:1–34:12.
[36]
Jiabao Lin & Hanpin Wang (2017). The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights. In Proceedings of ICALP 2017, 29:1–29:14.
[37]
Jingcheng Liu, Pinyan Lu & Chihao Zhang (2014). FPTAS for Counting Weighted Edge Covers. In Proceedings of ESA 2014, 654–665.
[38]
Jingcheng Liu, Alistair Sinclair & Piyush Srivastava (2018). The Ising Partition Function: Zeros and Deterministic Approximation. Journal of Statistical Physics 174(2), 287-315.
[39]
Pinyan Lu, Menghui Wang & Chihao Zhang (2014). FPTAS for Weighted Fibonacci Gates and Its Applications. In Proceedings of ICALP 2014, 787–799.
[40]
Joseph E. Mayer & Elliott Montroll (1941). Molecular Distribution. The Journal of Chemical Physics 9(1), 2–16.
[41]
Colin McQuillan (2013). Approximating Holant problems by winding. CoRR arxiv.org/abs/1301.2880.
[42]
Viresh Patel & Guus Regts (2017). Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM J. Comput. 46(6), 1893–1919.
[43]
Han Peters & Guus Regts (2019). On a Conjecture of Sokal Concerning Roots of the Independence Polynomial. Michigan Mathematical Journal 68(1), 33–55.
[44]
Guus Regts (2018). Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits. Combinatorica 38(4), 987–1015.
[45]
Alistair Sinclair & Mark Jerrum (1989). Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. Information and Computation 82(1), 93–133.
[46]
Allan Sly (2010). Computational Transition at the Uniqueness Threshold. In Proceedings of FOCS 2010, 287–296.
[47]
Richard P. Stanley (1999). Enumerative Combinatorics, volume 2. Cambridge University Press. ISBN 9781139811729 113981172X.
[48]
Leslie G. Valiant (2008). Holographic Algorithms. SIAM J. Comput. 37(5), 1565–1594.
[49]
Dror Weitz (2006). Counting independent sets up to the tree threshold. In Proceedings of STOC 2006, 140–149.
Recommendations
On the zeros of complex Van Vleck polynomials
Polynomial solutions to the generalized Lame equation, the Stieltjes polynomials, and the associated Van Vleck polynomials, have been studied extensively in the case of real number parameters. In the complex case, relatively little is known. Numerical ...
Zeros of exceptional Hermite polynomials
We study the zeros of exceptional Hermite polynomials associated with an even partition λ . We prove several conjectures regarding the asymptotic behaviour of both the regular (real) and the exceptional (complex) zeros. The real zeros are distributed as ...
Zero-freeness and approximation of real Boolean Holant problems
Highlights- Show the complexity of approximating real Boolean Holant problems.
- Present ...
AbstractHolant problems provide a novel framework to study the complexity of counting problems. It is a refinement to counting constraint satisfaction problems (#CSP) with a more explicit role for the constraint functions. Both graph ...
Comments
Information & Contributors
Information
Published In
© The Author(s) 2022. corrected publication 2022.
Publisher
Birkhauser Verlag
Switzerland
Publication History
Published: 01 December 2022
Author Tags
Author Tag
Qualifiers
- Research-article
Funding Sources
- Hasso-Plattner-Institut für Digital Engineering gGmbH (4420)
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025