AI & ML
A general framework for crystallization in maximal hard-core models
arXiv math.IT0 views
arXiv:2610.11042v1 Announce Type: cross Abstract: We study general maximal hard-core models on periodic lattice-type graphs. While for standard models, phase coexistence may arise for high activity, for maximal models this behavior may occur also for sufficiently low activity values. Relying on the concept of volume allocation, we develop a {\em unified set of assumptions} that imply the Peierls condition, a convergent cluster expansion for the partition function, and hence the conclusions of Pirogov-Sinai theory for this class of models. We further check these assumptions for a number of examples including standard lattice-type periodic graphs, proving crystallization for both high and low activity. We also derive estimates for the values of activity that bound the phase coexistence regions in the phase diagram, rewriting for this purpose the proof of a technical result in the derivation of Pirogov-Sinai theory.
Source:https://arxiv.org/abs/2610.11042PreviousA $G$-Invariant Erd\H{o}s--Hanani Theorem with Applications to Optical Orthogonal and Constant-Weight CodesNextA General $\widetilde{\Omega}(\sqrt{T \gamma_T})$ Lower Bound for Kernel Bandits
Related posts

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX
National Grid buys Teesside land for UK largest substation to power AI data center
0dev.to News

Leonardo AI Alternative in 2026
0dev.to Discuss

This is my first HacktoberFest, and I don't know what to feel.
0dev.to Discuss

12% of the Economy: The Benchmark That Grades AI Agents Like Employees
0dev.to Machine Learning
A headline said the CMB killed huge black holes. I read the two papers.
0dev.to Career