惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

A
About on SuperTechFans
小众软件
小众软件
宝玉的分享
宝玉的分享
Last Week in AI
Last Week in AI
有赞技术团队
有赞技术团队
雷峰网
雷峰网
Stack Overflow Blog
Stack Overflow Blog
Hugging Face - Blog
Hugging Face - Blog
人人都是产品经理
人人都是产品经理
J
Java Code Geeks
量子位
博客园 - 【当耐特】
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
SecWiki News
SecWiki News
阮一峰的网络日志
阮一峰的网络日志
Help Net Security
Help Net Security
I
InfoQ
W
WeLiveSecurity
Cloudbric
Cloudbric
Recorded Future
Recorded Future
T
The Exploit Database - CXSecurity.com
D
Docker
N
News and Events Feed by Topic
Cisco Talos Blog
Cisco Talos Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
The Hacker News
The Hacker News
NISL@THU
NISL@THU
Martin Fowler
Martin Fowler
Application and Cybersecurity Blog
Application and Cybersecurity Blog
博客园 - 司徒正美
B
Blog
Microsoft Azure Blog
Microsoft Azure Blog
G
GRAHAM CLULEY
云风的 BLOG
云风的 BLOG
Project Zero
Project Zero
S
Schneier on Security
P
Palo Alto Networks Blog
Know Your Adversary
Know Your Adversary
Google DeepMind News
Google DeepMind News
博客园 - 聂微东
月光博客
月光博客
M
MIT News - Artificial intelligence
The Register - Security
The Register - Security
博客园 - 三生石上(FineUI控件)
F
Full Disclosure
I
Intezer
MyScale Blog
MyScale Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
The GitHub Blog
The GitHub Blog
IT之家
IT之家

math.CO updates on arXiv.org

Short proofs of three combinatorial results in the Johnson scheme Linear and matrix generalizations of some combinatorial min-max theorems On hyperbolic corners and unit-area triangles in planar sets of large measure The mex statistic on combinatorial structures On Ending Partizan Subtraction Nim Pairs of square-free arithmetic progressions in infinite words Stotting in positional games Sumsets of random sets A Computational Study of Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs Elementary asymptotics for the Stirling numbers of the second kind: The central range Sharp threshold for Hamilton cycles in randomly perturbed sparse graphs On certain combinatorial expressions of TASEP transition probabilities Diameter Thresholds of Random Cayley Graphs Rowmotion on hook and two-row alt $ν$-Tamari lattices Comparative monotonicity of linear codes by Hermitian and symplectic hull dimensions Tightness of a MaxCut Lower Bound via Vector Chromatic Number A finite victory over de Bruijn-Erdős in interval discrepancy Cohomological support varieties for monomial ideals A stability theorem for embedding bounded degree spanning trees Subsequence Sums in Permutations Jump and Gradient Invariants in the Partition Graph Off-diagonal Ramsey numbers A note on the Alon-Saks-Seymour problem The sum-product conjecture is false for real numbers Limiting distributions of triangle counts in linear preferential attachment models Cutoff profiles for conjugacy invariant random walks on symmetric groups Improved bounds for the double cap conjecture A higher homological approach to the $q$-characters of representations of quantum affine algebras Ten Squares Force an Overlap Vertex-critical $(P_5,\text{chair})$-free and $(P_5,\text{cricket})$-free graphs Defect Spaces and Gram Operators for Tensor-Valued Incidence Maps Counterexamples to Clique Immersion Conjecture for Direct Products Intrinsic linking of simplicial $n$-complexes in $\mathbb{R}^{2n}$: An additional minimal $n$-complex Dual Chow polynomials of matroids and posets On the Ramsey classes of random hypergraphs Intersection Orbital Graphs of Permutation Groups and Reconstruction of Simple Groups On the Smallest Eigenvalues and Quantum Chromatic Numbers of Hamming Graphs and Generalizations Small-scale operations on graphic sequences Counterexamples to Stanley's conjecture on dimer coverings The Abu-Khzam$\unicode{x2013}$Langston Conjecture for Graphs with $α(G) = 2$ Two-disjoint-cycle-cover vertex pancyclicity of split-star networks Almost Affine Vector Rank-Metric Codes Hadwiger's Conjecture for $\{\text{co-claw}, \text{co-gem}\}$-free graphs and $\{\text{fork}, \text{antifork}\}$-free graphs Defining sets which intersect each Latin trade at least twice Proofs of Two Positivity Conjectures of Guo Graphs with girth 8 and without longer even holes are 3-colorable Mixed thresholds in the Lonely Runner Conjecture Sprout Symmetric Functions: Part 1 Tree-partitions of graphs with given pathwidth Dimensions of Mycielskians of cycles Constructing Block Designs from Complete Graphs Jordan types commuting with a hook partition Proper Additive Edge Colorings of Regular Graphs The $k$-out-of-$n$ picture-hanging puzzle: shorter solutions for small $k$ and $n-k$ Triangle Families with Large Edge Up-Laplacian Spectral Gap Explicit class of finite-dimensional polynomial algebras with Wronskians over $\mathbb{R}^d$ as $N$-ary Lie brackets: beyond $\mathfrak{sl}(2)$ Relations between categorifications of higher-dimensional type $A$ cluster combinatorics Two Arc-Disjoint Hamiltonian Paths in Finite Two-Generated Abelian Cayley Digraphs Inhomogeneous Approximation by Sums of Roots On the cycle structure of the symmetric tensor power of permutations $2$-word-$π$-representable Graphs Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical The list r-hued coloring of trees and unicyclic graphs Above and below Locally anti-blocking $\mathbf{g}$-polytopes for flow polytopes Words for generalized Markov numbers Polytopes and posets associated to preorders A palindromicity criterion for the $h$-polynomials of bipartite edge rings Signed Generalized Stirling Polynomials, Nested Sums, and Hyperbolic Secant Integral Identities Ramsey goodness of complete multipartite graphs with one large part Prime Certificates for Exact Vertex-Coprime Ramsey Numbers Combinatorics of Inflection Points of Plane Curve Shadows Absorbing States of Binary Trust Gossip Are Counted by Plane Partitions The V/L recursion for Macdonald's 7th Variation Schur polynomials Retraction of the complement of smooth projective curves to a $2$-dimensional $Δ$-complex Sum of the $k$ Largest Eigenvalues of Symmetric Matrices: Theory and Applications A Degree-Preserving Builder--Chooser Game Euclidean Steiner Shallow-Light Trees in Higher Dimensions Spectral Sidorenko inequalities and edge-spectral supersaturation Motivic Segre classes of Schubert cells and the connective formal group law A note on the exact partition polytope of Frieze and Teng The maximum number of paths of a given length in a nonhamiltonian graph Low Soundness Linearity Testing on the Half-Slice Problems in additive number theory, VII: The structure of additive $h$-bases for $n$ On planar functions over $\mathbb{F}_{q^3}$ The Fujimoto Conjecture via Total Positivity On modular inequalities for plane projective curves A note on integer programming methods for mixed radial Moore graphs A finite-board reduction for the Erdős Matching Conjecture and the 4-uniform case via exact certificates On partial groups of small order Extremal $t$-intersecting Families of Permutations for Large $t$ Random Permutations from Bott-Samelson Varieties On the maximal dimension of an irreducible representation of the symmetric group Intervals of hypergraph Turán densities Rainbow panconnectivity in a graph collection $K_{2,t+1}$-free graphs with many copies of $K_{t,t}$ Sharper Ramsey lower bounds from refined Gaussian estimates Amply regular graphs with $μ$ close to half the valency and group divisible designs Characterization of Word-Representable Near-Triangulations A Bruhat order for Latin squares and alternating sign hypermatrices
The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
Geyang Wang, Alexander Barg, Navin Kashyap · 2025-10-23 · via math.CO updates on arXiv.org

Recoverable systems provide coarse models of data storage on the two-dimensional square lattice, where each site reconstructs its value from neighboring sites according to a specified local rule. To study the typical behavior of recoverable patterns, this work introduces an interaction potential on the local recovery regions of the lattice, which defines a corresponding interaction model. We establish uniqueness of the Gibbs measure at high temperature and derive bounds on the entropy in the zero- and low-temperature regimes. For the recovery rule under consideration, exactly recoverable configurations coincide with maximal independent sets of the grid. Relying on methods developed for the standard hard-core model, we show phase coexistence at high activity in the maximal case. Unlike the standard hard-core model, however, the maximal version admits nontrivial ground states even at low activity, and we manage to classify them explicitly. We further verify the Peierls condition for the associated contour model. Combined with the Pirogov-Sinai theory, this shows that each ground state gives rise to an extremal Gibbs measure, proving phase coexistence at low activity.