- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials

- Viresh Patel, Guus Regts
- SIAM J. Comput.
- 2017

In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree… (More)

Abstract We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of [P. de la Harpe, V.F.R. Jones, Graph… (More)

- Han Peters, Guus Regts
- ArXiv
- 2017

A conjecture of Sokal (2001) regarding the domain of non-vanishing for independence polynomials of graphs, states that given any natural number $\Delta \ge 3$, there exists a neighborhood in $\mathbb… (More)

- Guus Regts
- Combinatorica
- 2015

Based on a technique of Barvinok [4,5,6] and Barvinok and Soberón [8,9] we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs.… (More)

- Alexander I. Barvinok, Guus Regts
- Combinatorics, Probability & Computing
- 2019

Given complex numbers $w_1, \ldots, w_n$, we define the weight $w(X)$ of a set $X$ of 0-1 vectors as the sum of $w_1^{x_1} \cdots w_n^{x_n}$ over all vectors $(x_1, \ldots, x_n)$ in $X$. We present… (More)

- Guus Regts, Alexander Schrijver
- Eur. J. Comb.
- 2012

Let G be a group of orthogonal transformations of a real Hilbert space H. Let R and W be bounded G-stable subsets of H. Let .R be the seminorm on H defined by xR:=suprR|r,x| for xH. We show that if W… (More)

- Andrew J. Goodall, Thomas Krajewski, Guus Regts, Lluís Vena
- Combinatorics, Probability & Computing
- 2016

We follow the example of Tutte in his construction of the dichromate of a graph (that is, the Tutte polynomial) as a unification of the chromatic polynomial and the flow polynomial in order to… (More)

- Dion Gijswijt, Guus Regts
- J. Comb. Theory, Ser. B
- 2010

A polyhedron P has the Integer Caratheodory Property if the following holds. For any positive integer k and any integer vector [email protected]?kP, there exist affinely independent integer vectors… (More)

- Guus Regts, Dion Gijswijt
- 2009

In this thesis we use a semidefinite programming approach to find explicit upper bounds on the size of ternary constant weight codes with prescribed minimum distance d. By constructing a graph Γ =… (More)

- Viresh Patel, Guus Regts
- Algorithmica
- 2017

In this paper we show that for any graph H of order m and any graph G of order n and maximum degree $$\Delta $$Δ one can compute the number of subsets S of V(G) that induces a graph isomorphic to H… (More)