For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.
Huijben, J., Patel, V., & Regts, G. (2023). Sampling from the low temperature Potts model through a Markov chain on flows. Random Structures and Algorithms, 62(1), 219-239. https://doi.org/10.1002/rsa.21089[details]
de Boer, D., Buys, P., & Regts, G. (2023). Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree. Combinatorics Probability and Computing, 32(1), 158-182. https://doi.org/10.1017/S0963548322000207[details]
Buys, P., Galanis, A., Patel, V., & Regts, G. (2022). Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs. Forum of Mathematics, Sigma, 10, [e7]. https://doi.org/10.1017/fms.2022.4
Garijo, D., Goodall, A., Nešetřil, J., & Regts, G. (2022). Polynomials and graph homomorphisms. In J. Ellis-Monaghan, & I. Moffat (Eds.), Handbook of the Tutte Polynomial and Related Topics (pp. 405-422). CRC Press. https://doi.org/10.1201/9780429161612-22[details]
2021
Bencs, F., Csikvári, P., & Regts, G. (2021). Some Applications of Wagner's Weighted Subgraph Counting Polynomial. The Electronic Journal of Combinatorics, 28(4), [4-14]. https://doi.org/10.37236/10185[details]
Bencs, F., Davies, E., Patel, V., & Regts, G. (2021). On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. Annales de l'Institut Henri Poincaré D, 8(3), 459-489. https://doi.org/10.4171/AIHPD/108[details]
Buys, P., Galanis, A., Patel, V. S., & Regts, G. (2021). Lee-yang zeros and the complexity of the ferromagnetic ising model on bounded-degree graphs. In D. Marx (Ed.), Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms: SODA '21 (pp. 1508-1519). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.48550/arXiv.2006.14828, https://doi.org/10.1137/1.9781611976465.91[details]
Abiad, A., Gribling, S., Lahaye, D., Mnich, M., Regts, G., Vena, L., ... Zwaneveld, P. (2020). On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discrete Optimization, 37, [100565]. https://doi.org/10.1016/j.disopt.2019.100565[details]
Goodall, A., Litjens, B., Regts, G., & Vena, L. (2020). A Tutte polynomial for maps II: The non-orientable case. European Journal of Combinatorics, 86, [103095]. https://doi.org/10.1016/j.ejc.2020.103095[details]
Peters, H., & Regts, G. (2020). Location of zeros for the partition function of the Ising model on bounded degree graphs. Journal of the London Mathematical Society, 101(2), 765-785. https://doi.org/10.1112/jlms.12286[details]
Barvinok, A., & Regts, G. (2019). Weighted counting of solutions to sparse systems of equations. Combinatorics Probability and Computing, 28(5), 696-719. https://doi.org/10.1017/S0963548319000105[details]
Helmuth, T., Perkins, W., & Regts, G. (2019). Algorithmic Pirogov-Sinai theory. In M. Charikar, & E. Cohen (Eds.), STOC '19: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 1009-1020). New York, NY: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316305[details]
Peters, H., & Regts, G. (2019). On a Conjecture of Sokal Concerning Roots of the Independence Polynomial. The Michigan mathematical journal, 68(1), 33-55. https://doi.org/10.1307/mmj/1541667626[details]
Goodall, A., Litjens, B., Regts, G., & Vena, L. (2017). A Tutte polynomial for non-orientable maps. Electronic Notes in Discrete Mathematics, 61, 513-519. https://doi.org/10.1016/j.endm.2017.07.001[details]
Kang, R. J., Long, E., Patel, V., & Regts, G. (2017). On a Ramsey-type problem of Erdős and Pach. Bulletin of the London Mathematical Society, 49(6), 991-999. https://doi.org/10.1112/blms.12094[details]
Patel, V., & Regts, G. (2017). Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM Journal on Computing, 46(6), 1893-1919. https://doi.org/10.1137/16M1101003[details]
Patel, V., & Regts, G. (2017). Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. Electronic Notes in Discrete Mathematics, 61, 971-977. https://doi.org/10.1016/j.endm.2017.07.061[details]
Regts, G., & Sevenster, B. (2017). Partition functions from orthogonal and symplectic group invariants. Electronic Notes in Discrete Mathematics, 61, 1011-1017. https://doi.org/10.1016/j.endm.2017.07.066[details]
Regts, G., Schrijver, A., & Sevenster, B. (2017). On the existence of real R-matrices for virtual link invariants. Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 87(2), 435-443. https://doi.org/10.1007/s12188-016-0175-9[details]
Regts, G. (2016). Regularity lemmas in a Banach space setting. European journal of combinatorics = Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik, 51, 347-358. https://doi.org/10.1016/j.ejc.2015.06.006[details]
Regts, G., & Schrijver, A. (2016). Compact orbit spaces in Hilbert spaces and limits of edge-colouring models. European journal of combinatorics = Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik, 52(B), 389-395. https://doi.org/10.1016/j.ejc.2015.07.013[details]
Kang, R. J., Pach, J., Patel, V., & Regts, G. (2015). A Precise Threshold for Quasi-Ramsey Numbers. SIAM Journal on Discrete Mathematics, 29(3), 1670-1682. https://doi.org/10.1137/14097313X[details]
Coulson, M., Davies, E., Kolla, A., Patel, V., & Regts, G. (2020). Statistical physics approaches to Unique Games. In S. Saraf (Ed.), 35th Computational Complexity Conference: CCC 2020, July 28–31, 2020, Saarbrücken, Germany (Virtual Conference) [13] (Leibniz International Proceedings in Informatics; Vol. 169). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2020.13[details]
van der Aalst, T., Denteneer, D., Döring, H., Duong, M. H., Kang, R. J., Keane, M., ... Tomczyk, J. (2013). The random disc thrower problem. In M. Heydenreich, S. Hille, V. Rottschäfer, F. Spieksma, & E. Verbitskiy (Eds.), Proceedings of the 90th European Study Group Mathematics with Industry: SWI 2013: Leiden, 28 Janurary - 1 February 2013 (pp. 59-78). Leiden: Universiteit Leiden, Studiegroep Wiskunde met de Industrie. [details]
Peters, H., & Regts, G. (2019). Een discrete vraag, een complexe oplossing. Nieuw Archief voor Wiskunde, 5/20(4), 245-247. [details]
Others
Patel, V. (participant) & Regts, G. (participant) (17-5-2021 - 21-5-2021). Extremal and Algorithmic Aspects of Partition Functions (organising a conference, workshop, ...).
Patel, V. (participant) & Regts, G. (participant) (17-5-2021 - 21-5-2021). Extremal and Algorithmic Aspects of Partition Functions (organising a conference, workshop, ...).
Peters, H. (organiser), Roeder, R. G. (organiser) & Regts, G. (participant) (17-5-2021 - 21-5-2021). Extremal and Algorithmic Aspects of Partition Functions (organising a conference, workshop, ...).
Patel, V. S. (organiser) & Regts, G. (organiser) (23-8-2018 - 24-8-2018). 2-day Workshop on Algorithmic and Combinatorial Aspects of Partition Functions, Amsterdam. Topic: The study of various types of partition functions is a very active area of research and lies at the interface of combinatorics, probability, (…) (organising a conference, workshop, ...).
2022
Buys, P. (2022). Partition functions: Zeros, unstable dynamics and complexity. [details]
The UvA website uses cookies and similar technologies to ensure the basic functionality of the site and for statistical and optimisation purposes. It also uses cookies to display content such as YouTube videos and for marketing purposes. This last category consists of tracking cookies: these make it possible for your online behaviour to be tracked. You consent to this by clicking on Accept. Also read our Privacy statement
Necessary
Cookies that are essential for the basic functioning of the website. These cookies are used to enable students and staff to log in to the site, for example.
Necessary & Optimalisation
Cookies that collect information about visitor behaviour anonymously to help make the website work more effectively.
Necessary & Optimalisation & Marketing
Cookies that make it possible to track visitors and show them personalised adverts. These are used by third-party advertisers to gather data about online behaviour. To watch Youtube videos you need to enable this category.