5 results
Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial
- Part of
-
- Journal:
- Mathematical Proceedings of the Cambridge Philosophical Society / Volume 176 / Issue 2 / March 2024
- Published online by Cambridge University Press:
- 24 November 2023, pp. 459-494
- Print publication:
- March 2024
-
- Article
-
- You have access
- HTML
- Export citation
Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 32 / Issue 1 / January 2023
- Published online by Cambridge University Press:
- 07 September 2022, pp. 158-182
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- Part of
-
- Journal:
- Forum of Mathematics, Sigma / Volume 10 / 2022
- Published online by Cambridge University Press:
- 07 February 2022, e7
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Weighted counting of solutions to sparse systems of equations
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 28 / Issue 5 / September 2019
- Published online by Cambridge University Press:
- 15 April 2019, pp. 696-719
-
- Article
- Export citation
A Tutte Polynomial for Maps
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 6 / November 2018
- Published online by Cambridge University Press:
- 12 April 2018, pp. 913-945
-
- Article
- Export citation