Deterministic counting from coupling independence

We show that spin systems with bounded degrees and coupling independence admit fully polynomial time approximation schemes (FPTAS). We design a new recursive deterministic counting algorithm to achieve this. As applications, we give the first FPTASes for $q$-colourings on graphs of bounded maximum degree $\mathrm{\Delta }\ge 3$, when $q\ge (11\mathrm{/}6-{\epsilon }_0)\mathrm{\Delta }$ for some small ${\epsilon }_0\approx {10}^{-5}$, or when $\mathrm{\Delta }\ge 125$ and $q\ge 1.809\mathrm{\Delta }$, and on graphs with sufficiently large (but constant) girth, when $q\ge \mathrm{\Delta }+3$. These bounds match the current best randomised approximate counting algorithms by Chen, Delcourt, Moitra, Perarnau, and Postle (2019), Carlson and Vigoda (2024), and Chen, Liu, Mani, and Moitra (2023), respectively.