PreprintarXiv licencearXiv
Factor of i.i.d. with polynomial tails for the long-range Ising model
Abstract
We prove that the very-high temperature long-range Ising model on Zd is a factor of an i.i.d. process, and provide quantitative information on the coding radius. We do not assume that the model is ferromagnetic, but require the interactions to decay faster than 1/n2d. While previous constructions were known, the novelty of our approach is that we obtain an explicit polynomial upper bound on the tail of the coding radius. In particular, our construction yields a factor map with finite expected coding volume. This answers a question of a recent preprint by Chazottes, Gallo and Takahashi, see arXiv:2602.14618.
Related
- Arithmetic k-Polynomial Dynamical Localization for k Power-Law Quasi-Periodic Long-Range Operators on ℓ2(ℤd)
- Normal approximation for total magnetization in subcritical long-range Ising models
- Dice enterprises and polynomial approximation: uniform query tails
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231
- A short proof of a range-relative FPTAS for polynomial integer optimization over bounded polyhedra
BibTeX
@misc{faipeur2026factor,
title = {{Factor of i.i.d. with polynomial tails for the long-range Ising model}},
author = {Corentin Faipeur},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.18758},
eprint = {2609.18758},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.18758},
}
RIS
TY - UNPB
TI - Factor of i.i.d. with polynomial tails for the long-range Ising model
AU - Corentin Faipeur
PY - 2026
DA - 2026/09/16
PB - arXiv
DO - 10.48550/arxiv.2609.18758
UR - https://arxiv.org/abs/2609.18758
AB - We prove that the very-high temperature long-range Ising model on Z^d is a factor of an i.i.d. process, and provide quantitative information on the coding radius. We do not assume that the model is ferromagnetic, but require the interactions to decay faster than 1/n^2d. While previous constructions were known, the novelty of our approach is that we obtain an explicit polynomial upper bound on the tail of the coding radius. In particular, our construction yields a factor map with finite expected coding volume. This answers a question of a recent preprint by Chazottes, Gallo and Takahashi, see arXiv:2602.14618.
ER -