{"paper":{"title":"Completely packed O($n$) loop models and their relation with exactly solved coloring models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"Henk W. J. Bl\\\"ote, Wenan Guo, Yougang Wang","submitted_at":"2014-11-03T07:01:30Z","abstract_excerpt":"We explore the physical properties of the completely packed O($n$) 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 ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0378","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}