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

推荐订阅源

L
LangChain Blog
B
Blog RSS Feed
阮一峰的网络日志
阮一峰的网络日志
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
H
Help Net Security
MyScale Blog
MyScale Blog
WordPress大学
WordPress大学
Microsoft Azure Blog
Microsoft Azure Blog
GbyAI
GbyAI
小众软件
小众软件
大猫的无限游戏
大猫的无限游戏
Martin Fowler
Martin Fowler
Vercel News
Vercel News
S
SegmentFault 最新的问题
M
MIT News - Artificial intelligence
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
Last Week in AI
Last Week in AI
Hugging Face - Blog
Hugging Face - Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 【当耐特】
Google DeepMind News
Google DeepMind News
Engineering at Meta
Engineering at Meta
云风的 BLOG
云风的 BLOG

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}}$
Lee-Yang Zeros of the antiferromagnetic Ising Model
Ferenc Bencs, Pjotr Buys, Lorenzo Guerini, Han Peters · 2019-07-17 · via math.CO updates on arXiv.org

We investigate the location of zeros for the partition function of the anti-ferromagnetic Ising Model, focusing on the zeros lying on the unit circle. We give a precise characterization for the class of rooted Cayley trees, showing that the zeros are nowhere dense on the most interesting circular arcs. In contrast, we prove that when considering all graphs with a given degree bound, the zeros are dense in a circular sub-arc, implying that Cayley trees are in this sense not extremal. The proofs rely on describing the rational dynamical systems arising when considering ratios of partition functions on recursively defined trees.