Completely packed O($n$) loop models and their relation with exactly solved coloring models
Yougang Wang, Wenan Guo, and Henk W. J. Bl\"ote

TL;DR
This paper investigates the properties of a generalized O(n) loop model on the square lattice, revealing exact solutions and phase transition behaviors, including first-order transitions and connections to coloring models and Potts/Ising models.
Contribution
It introduces a generalized Eulerian graph model with crossing bonds and cubic vertices, linking it to exactly solved coloring models and analyzing phase transitions.
Findings
Identifies a branch with nonintersecting loops corresponding to Potts model transitions.
Discovers a first-order Ising-like transition for n>2 in the cubic vertex branch.
Describes a low-temperature phase with corner-cubic anisotropy for 1<n<2.
Abstract
We explore the physical properties of the completely packed O() loop model on the square lattice, and its generalization to an Eulerian graph model, which follows by including cubic vertices which connect the four incoming loop segments. This model includes crossing bonds as well. Our study of the properties of this model involve transfer-matrix calculations and finite-size scaling. The numerical results are compared to existing exact solutions, including solutions of special cases of a so-called coloring model, which are shown to be equivalent with our generalized loop model. The latter exact solutions correspond with seven one-dimensional branches in the parameter space of our generalized loop model. One of these branches, describing the case of nonintersecting loops, is already known to correspond with the ordering transition of the Potts model. We find that another exactly solved…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
