Metraipolis › archive › dc_e143e01ede92
Dimer model and random lattice permutations with general weights — arXiv:2609.29671
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29671
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:07:51.622Z
- SHA-256 of the archived text
9a2f8a42f368afa08d0ae22613bf090f093b127318461582d2471486f065f3a6- Stable URL of this page
https://metraipolis.com/documento/dc_e143e01ede92
How to cite
Dimer model and random lattice permutations with general weights — arXiv:2609.29671 — arXiv (en), https://arxiv.org/abs/2609.29671 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e143e01ede92 (Metraipolis archive dc_e143e01ede92, sha256 9a2f8a42f368afa08d0ae22613bf090f093b127318461582d2471486f065f3a6)
BibTeX
@misc{dce143e01ede92,
title = {Dimer model and random lattice permutations with general weights — arXiv:2609.29671},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29671},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e143e01ede92; sha256 9a2f8a42f368afa08d0ae22613bf090f093b127318461582d2471486f065f3a6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29671. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The dimer model and random lattice permutations are two fundamental objects at the interface of probability, combinatorics, and mathematical physics. We study these models on finite periodic boxes in $\mathbb Z^d$ within a common framework. For the dimer model, edges connecting arbitrary vertices carry a weight which depends on their relative displacement and dimer configurations are weighted through their occupied edges. Superimposing two independent perfect matchings gives the double-dimer model, whose configurations are collections of disjoint loops. Permutations, instead, are weighted through the spatial displacement of their jumps. For broad classes of weights of finite or infinite range we prove long-range order and the occurrence of macroscopic loops. This extends nearest-neighbour results to arbitrary-range edges and jumps. In particular, long-range weights yield long-range order and macroscopic loops already in dimensions $d=1,2$. In dimension two, this behaviour is qualitatively different from that of the nearest-neighbour model. We complement these results with sharp absence criteria. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.PR). Categorie arXiv: Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.29671 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T05:35:05.143Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).