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

推荐订阅源

博客园 - Franky
N
Netflix TechBlog - Medium
宝玉的分享
宝玉的分享
Google DeepMind News
Google DeepMind News
腾讯CDC
G
Google Developers Blog
Martin Fowler
Martin Fowler
Microsoft Security Blog
Microsoft Security Blog
Recent Announcements
Recent Announcements
爱范儿
爱范儿
Engineering at Meta
Engineering at Meta
Microsoft Azure Blog
Microsoft Azure Blog
A
About on SuperTechFans
aimingoo的专栏
aimingoo的专栏
有赞技术团队
有赞技术团队
Jina AI
Jina AI
人人都是产品经理
人人都是产品经理
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
M
MIT News - Artificial intelligence
罗磊的独立博客
博客园 - 三生石上(FineUI控件)
美团技术团队
WordPress大学
WordPress大学
阮一峰的网络日志
阮一峰的网络日志

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Strong Spatial Mixing for General 2-Spin Systems: A Unifi...
[Submitted on 17 Jan 2024 (v1), last revised 16 Jul 2026 (this v · 2024-01-18 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study the algorithmic implications of zero-free regions for the partition functions of 2-spin systems. While Barvinok's algorithm yields FPTASes in such regions, the applicability of Weitz's algorithm is limited to parameter regimes where strong spatial mixing (SSM) can be established. It remains open whether Weitz's algorithm can be applied to general zero-free regions, particularly in settings where no standard tree-recurrence-based proof of SSM is known. We establish new SSM results and thereby extend the applicability of Weitz's FPTAS to all currently known zero-free regions of 2-spin systems with pinned vertices. We achieve this through a unified approach to deriving SSM from zero-freeness in the most general settings of 2-spin systems. Our work features two key innovations.
this http URL SSM results cover parts of the celebrated Lee-Yang zero-free region for the ferromagnetic Ising model, where no tree-recurrence-based proof of SSM is currently known or considered feasible. The tree recurrence method typically relies on carefully designed potential functions, the construction and analysis of which can be highly challenging. For ferromagnetic 2-spin systems, it remains an open challenge whether such potential functions can be constructed. We circumvent this difficulty by deriving SSM directly from zero-freeness.
this http URL prior approach to deriving SSM from zero-freeness relies on cluster expansions, which are model-specific and known only for a few restricted parameter settings such as the hard-core model near vertex activity $\lambda=1$. We overcome this obstacle by introducing a purely combinatorial approach based on a novel Christoffel-Darboux-type identity that holds universally for 2-spin systems. This provides a broadly applicable framework for handling general 2-spin systems with arbitrary multivariate parameters and zero-free regions of arbitrary shape in a unified manner.

Submission history

From: Xiaowei Ye [view email]
[v1] Wed, 17 Jan 2024 16:41:57 UTC (561 KB)
[v2] Wed, 10 Apr 2024 15:00:11 UTC (561 KB)
[v3] Sat, 8 Feb 2025 12:06:16 UTC (757 KB)
[v4] Thu, 16 Jul 2026 15:46:41 UTC (306 KB)