It gives the first efficient algorithm to count the vast number of particle arrangements in a system where neighbors prefer opposite states on random networks. It reaches a theoretical limit for when efficient solutions are believed to exist, for a wide range of interaction strengths.
On Zeros and Algorithms for Disordered Systems II: The Antiferromagnetic Ising Model up to Kesten-Stigum · Ferenc Bencs, Brice Huang, Daniel Z. Lee et al. · arXiv:2610.40598
The paper shows approximate solutions can be found much further into complex settings on random networks, up to a critical phase transition. It offers new, faster algorithms, reaching a critical phase transition where these problems become fundamentally intractable.
Zero-freeness for Random Regular Graphs up to the Replica Symmetry Breaking Threshold · Zejia Chen, Chunyang Wang, Xinyuan Zhang · arXiv:2610.40510
The paper gives a new, more streamlined proof of the Segal conjecture for Cp in stable homotopy theory. It offers a more elegant argument for a foundational theorem and may open new ways to tackle similar problems.
A short proof of the Segal conjecture for $C_p$ · Thomas Nikolaus · arXiv:2610.39440
The paper establishes a precise law of the iterated logarithm for sums of random multiplicative functions, whose values come from coin flips at primes. It offers new insights into number-theoretic functions that appear random but are actually deterministic.
A self-normalized law of the iterated logarithm for Rademacher random multiplicative functions · Dariusz Buraczewski, Alexander Iksanov · arXiv:2610.40605
For nine dimensions or more, the paper proves the maximum number of points at two distances with ratio one to square root of two, and one unique arrangement reaches it. It gives precise answers in many dimensions without checking every possibility, improving understanding of efficient point arrangements.
Johnson optimality and uniqueness for distance ratio $1:\sqrt{2}$ · Bryan Bu, Chin-Yen Lee, Yu-Hang Sheng et al. · arXiv:2610.40367
The work measures how far a grid path that never crosses itself typically gets and gives a strong limit showing it spreads less than thought. It sharpens basic understanding of random paths that model things in polymer physics.
Quantitative sub-ballisticity of self-avoiding walk on $\mathbb{Z}^d$ · Ekin Arikök, Christoforos Panagiotis, Nicholas Pischke et al. · arXiv:2610.40520
For Kähler manifolds with tightly constrained curvature, the authors prove the space must be finite in size or Ricci-flat. Kähler manifolds are key to theories like string theory, and this classification helps map possible geometries of the universe.
Complete Kähler Manifolds with pinched Ricci curvature · Yuxing Deng, Ruyi Ji · arXiv:2610.40419
For many realistic sparse networks, standard statistical tools can estimate averages and their uncertainty without knowing the full network structure. It helps when only a small fraction of a large network is observed, making network analysis more accessible.
Central Limit Theorems and Network-Free Inference for Heterogeneous Spatial Autoregressions on Sparse Graphons · Wei Li, Robert Lunde · arXiv:2610.40630
Spectral likelihood-ratio clustering combines graph connection analysis with a refinement step that re-evaluates each node without checking every edge. It finds communities in complex networks with nearly best possible accuracy, including very large sparse networks.
A graphical tool called the reachable syzygy quiver maps dependencies in an algebra, and path lengths help calculate its global and finitistic dimensions. For certain specific algebras, the map simplifies so their dimensions can be exactly determined.
Syzygy-Quiver Formulas and Finitistic Dimensions of Special Biserial Algebras · Shantanu Sardar · arXiv:2610.39672