C -networks and the planar Ising inverse problem
International Mathematics Research Notices · 25.11.2026 · 2026 (22)
DOI: 10.1093/imrn/rnag268 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Mathematics Research Notices, online erschienen am 12.11.2026. Verfasst von Yassine Elmaazouz und 1 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben.
Abstract (Originalsprache)
We solve the inverse problem for Ising models on reduced planar graphs in a disk, that is, 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 that asserts that the inverse map factors through variables on the graph that transform under the Ising Y-$\Delta $ move according to the discrete C-type Kadomtsev–Petviashvili (CKP) equation.
Zitieren
APA
Elmaazouz, Y., & George, T. (2026). C -networks and the planar Ising inverse problem. International Mathematics Research Notices, 2026(22). https://doi.org/10.1093/imrn/rnag268
Vancouver
Elmaazouz Y, George T. C -networks and the planar Ising inverse problem. International Mathematics Research Notices. 2026;2026(22). doi:10.1093/imrn/rnag268
BibTeX
@article{Elmaazouz2026,
author = {Elmaazouz, Yassine and George, Terrence},
title = {C -networks and the planar Ising inverse problem},
journal = {International Mathematics Research Notices},
year = {2026},
volume = {2026},
number = {22},
doi = {10.1093/imrn/rnag268}
}
EUVIMED