Regts, Guus

1. On a conjecture of Sokal concerning roots of the independence polynomial
   2017/01/27 by Peters, Han, Regts, Guus · 2 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics
2. Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial
   2021/04/23 by de Boer, David, Buys, Pjotr, Guerini, Lorenzo +2 · 2 citations
   #03D15 #05C31 #37F10 #Combinatorics (math.CO) #Complex Variables (math.CV) #Dynamical Systems (math.DS) #FOS: Mathematics
3. On the Caratheodory rank of polymatroid bases
   2010/03/04 by Gijswijt, Dion, Regts, Guus · 1 citation
   #52B40 #90C10 #Combinatorics (math.CO) #FOS: Mathematics #Optimization and Control (math.OC)
4. Edge-reflection positivity and weighted graph homomorphisms
   2013/02/26 by Regts, Guus · 1 citation
   #05C99 #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #FOS: Mathematics
5. Deterministic approximate counting of colorings with fewer than 2Δ colors via absence of zeros
   2024/08/08 by Bencs, Ferenc, Berrekkal, Khallil, Regts, Guus · 2 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
6. Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
   2020/06/26 by Buys, Pjotr, Galanis, Andreas, Patel, Viresh +1 · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
7. On boundedness of zeros of the independence polynomial of tori
   2023/06/22 by de Boer, David, Buys, Pjotr, Peters, Han +1 · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph)
8. A near-optimal zero-free disk for the Ising model
   2023/11/09 by Patel, Viresh, Regts, Guus, Stam, Ayla · 1 citation
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph)
9. On the location of chromatic zeros of series-parallel graphs
   2022/04/21 by Bencs, Ferenc, Huijben, Jeroen, Regts, Guus · 1 citation
   #05C31 (Primary) 05C15 #37F10 #82B20 (Secondary) #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics
10. Approximating the chromatic polynomial is as hard as computing it exactly
    2022/11/24 by Ferenc Bencs, J. Huijben, Bencs, Ferenc +3 · 1 citation
    Computer Science · Mathematics · #05C31 #68Q17 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Topological and Geometric Data Analysis #primary #secondary