Paperlane

no. 3 · Tuesday 27 October 2026

$C$-networks and the planar Ising inverse problem

Yassine Elmaazouz and Terrence George

math.CO · v2 · 40 pp

Abstract

We solve the inverse problem for Ising models on reduced planar graphs in a disk, i.e., recovering the edge coupling constants from the boundary spin correlations. A recursive solution to this problem was provided by Galashin–Pylyavskyy. Our solution is nonrecursive. It is based on an Ising analog of the chamber ansatz which asserts that the inverse map factors through variables on the graph that transform under the Ising Y-$Δ$ move according to the discrete CKP equation.

comments
40 pages, 19 figures
fields
Combinatorics, Mathematical Physics
pdf ↗ page arXiv:2606.15082 ↗