Dr. P.J.W. (Pjotr) Buys
Faculty of Science
KDV
Visiting address
- Science Park 107
Postal address
-
Postbus 94248
1090 GE Amsterdam
Contact details
-
Publications
2024
- Bencs, F., Buys, P., & Peters, H. (2024). The Limit of the Zero Locus of the Independence Polynomial for Bounded Degree Graphs. Michigan Mathematical Journal, 1(1). https://doi.org/10.1307/mmj/20226256
de Boer, D., Buys, P., Guerini, L., Peters, H., & Regts, G. (2024). Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial. Mathematical Proceedings of the Cambridge Philosophical Society, 176(2), 459-494. https://doi.org/10.1017/S030500412300052X [details]
2023
- Bencs, F., de Boer, D., Buys, P., & Regts, G. (2023). Uniqueness of the Gibbs Measure for the Anti-ferromagnetic Potts Model on the Infinite Δ-Regular Tree for Large Δ. Journal of Statistical Physics, 190, Article 140. https://doi.org/10.1007/s10955-023-03145-z [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]
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, Article e7. https://doi.org/10.1017/fms.2022.4 [details]
2021
- Buys, P. (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 [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]
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., Guerini, L., Peters, H., & Regts, G. (2024). Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial. Mathematical Proceedings of the Cambridge Philosophical Society, 176(2), 459-494.