P.J.W. (Pjotr) Buys MSc
Faculty of Science
KDV
Visiting address
- Science Park 107
Postal address
- Postbus 94248
1090 GE Amsterdam
Contact details
-
Publications
2023
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]
2022
- Bencs, F., Buys, P., Guerini, L., & Peters, H. (2022). Lee-Yang zeros of the antiferromagnetic Ising Model. Ergodic theory and dynamical systems, 42(7), 2172-2206. https://doi.org/10.1017/etds.2021.25 [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 [details]
2021
- Buys, P. J. W. (2021). Cayley trees do not determine the maximal zero-free locus of the independence polynomial. The Michigan mathematical journal, 70(3), 635-648. https://doi.org/10.1307/mmj/1599206419
- 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]
This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list. -
Ancillary activities
No ancillary activities
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.