2 citations · 4 across the 2 of their papers we have counts for
3 papers
math.CO2021★ 2 cited
Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial
David de Boer, Pjotr Buys, Lorenzo Guerini +2
The independence polynomial originates in statistical physics as the partition function of the hard-core model. The location of the complex zeros of the polynomial is related to ph…
cs.CC2020
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Pjotr Buys, Andreas Galanis, Viresh Patel +1
We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter on the unit circle in the compl…
math.CO2019★ 2 cited
On the location of roots of the independence polynomial of bounded degree graphs
Pjotr Buys
In [1] Peters and Regts confirmed a conjecture by Sokal by showing that for every there exists a complex neighborhood of the interval $\left[0, \frac{\le…