Guus Regts

activity

20102026

most citedDeterministic polynomial-time approximation algorithms for partition functions and graph polynomials

115 citations · 254 across the 43 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Some applications of Wagner's weighted subgraph counting polynomial

Ferenc Bencs, Péter Csikvári, Guus Regts

We use Wagner's weighted subgraph counting polynomial to prove that the partition function of the anti-ferromagnetic Ising model on line graphs is real rooted and to prove that roo…

math.PR2020★ 5 cited

Uniqueness of the Gibbs measure for the $4$ -state anti-ferromagnetic Potts model on the regular tree

David de Boer, Pjotr Buys, Guus Regts

We show that the $4$ -state anti-ferromagnetic Potts model with interaction parameter $w \in (0, 1)$ on the infinite $(d + 1)$ -regular tree has a unique Gibbs measure if $w\geq 1-\frac{4…

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…

Some applications of Wagner's weighted subgraph counting polynomial

Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree

Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

Uniqueness of the Gibbs measure for the $4$ -state anti-ferromagnetic Potts model on the regular tree