Matching works

20 works

math.MP — Mathematical Physics

Phase Transition and Spontaneous Translation Symmetry Breaking in Negative Temperature Point Vortex Ensembles

Contributed by Francesco Grotto, Marco Romito

We establish a canonical phase transition and spontaneous translation symmetry breaking for balanced two-species point vortices on the square torus. A sharp inequality identifies the transition at β=4π2\beta=4\pi^2, below collapse at β=16π\beta=16\pi. In the intervening regime, all global minimizers form one translation orbit of an explicit dipole. We prove a large deviation principle below collapse and identify the uniform random phase, phase-centered Gaussian fluctuations, and precise partition asymptotics in the ordered regime. For general prescribed bounded strengths, we distinguish global ordering, local instability, and collapse.

Primarily AI-generated textHuman understanding: some partsNegative TemperaturePhase TransitionPoint vortexSpontaneous Symmetry Breaking
Nov 16, 202665 pages
PDFView work

math.PR — Probability

Stationary prediction from finite calibration: obstructions and sharp history rates under interval catastrophes

Contributed by Man Huang

Can calibration experiments confined to a fixed spatial diameter determine stationary block probabilities on larger spatial scales? We answer this question for a one-dimensional recovery process driven by independent rows of Poisson interval catastrophes with an unknown intensity law, under a common small recovery-weighted intensity budget. For every calibration diameter, two laws have exactly the same complete local damage-word distributions and deterministic-initial experimental transcripts, even under arbitrarily many adaptive repetitions, while a sufficiently large stationary block has probabilities separated by a positive constant. The pair also matches intensity moments of orders zero, one and two and the eventual power-law parameters. For the upper stationary open phase, we then prove that all-open finite-history approximations converge uniformly over a law class and all finite targets if and only if the recovery-weighted tails vanish uniformly. Under a common intensity-moment budget of order 2+ϵ2+\epsilon, 0<ϵ≤10<\epsilon\le1, the worst missing-history error has matching scale min⁡{b,B[max⁡(m0,T)]−ϵ}\min\{b,B[\max(m_0,T)]^{-\epsilon}\}, with constants depending only on a fixed small recovery budget bb. Here TT counts retained physical rows, BB is the moment budget and m0m_0 the minimum interval length. The lower bound holds at one fixed site; the upper bound covers every finite target and the full moment class, including zero intensity and laws without regular variation. Together, these results identify the obstruction to local calibration, the exact tail condition for uniform history approximation, and the sharp deterministic depth of the all-open truncation.

Author comments: 28 pages, including all references and Appendices A-C. English text of version 2026-11-16.1. Complete bilingual edition, source and finite diagnostic materials: https://doi.org/10.5281/zenodo.24268525 (https://zenodo.org/records/24268525).

Primarily AI-generated textHuman understanding: some partscorrelated catastrophesfinite calibrationhistory truncationpartial identificationstationary prediction
Nov 16, 202628 pages
PDFView work

math.PR — Probability

Towards a conformal field theory of critical percolation. I. The bulk stress tensor and Ward identities.

Contributed by Alberto Gandolfi

We construct joint correlations of the bulk holomorphic stress tensor and the density field for critical site percolation on the triangular lattice, allowing any fixed finite numbers of insertions at separated points in the plane. Density correlations encode open-cluster connections; their two-point function is the renormalized probability that an open path joins two marked sites. Each stress insertion probes the directional response of these connections by closing and rotating a small ellipse and extracting the second angular component. To justify this construction, we extend Camia’s existence and conformal covariance results for density correlations from simply connected domains to the domains with finitely many analytic holes created by the ellipses, and prove uniform bounds for combining these correlations with the local ellipse responses. The main estimate controls the complete frontier record: the second angular coefficient has a comparable-scale defect of order (r/d)^(9/4), giving a Cauchy exponent 1/4 after quadratic normalization. The limits require no radius averaging, are distributions in the density coordinates, and are independent of the fixed ellipse shape parameters. They satisfy the conformal Ward identities with central charge zero and yield sequential stress-collision and contour identities.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 15, 2026105 pages
PDFView work

math.CO — Combinatorics

An upper bound for the connective constant of the square lattice

Contributed by Tejasvi Singh Tomar

We prove that the connective constant μ\mu of the square lattice Z2\mathbb{Z}^2, the exponential growth rate of the number of nn-step self-avoiding walks, satisfies μ≤2.6586513\mu\le2.6586513. The previous best upper bound, μ≤2.662342426\mu\le2.662342426, is due to Couronné. Like the bounds of Pönitz and Tittmann and of Couronné, ours comes from a finite automaton that remembers a bounded part of the past of the walk. The new idea is to count bridges. Since they can all be preceded by the same infinite history, the automaton may treat as visited the unvisited cells that no infinite self-avoiding continuation can reach, and three tests on the current state and the next step recognize such cells. The bound is checked in exact integer arithmetic and proved in the Lean proof assistant.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715896

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.PR — Probability

Homological percolation in characteristic two: the Ising gauge case

Contributed by Tejasvi Singh Tomar

Duncan and Schweinhart proved that the ii-dimensional plaquette random-cluster model with cluster weight qq on the 2i2i-dimensional torus has a sharp homological percolation transition at the self-dual point, for coefficients in a field of characteristic other than 22. Their proof needs the point group of the lattice to act irreducibly on the ii-th homology of the torus. In characteristic 22 it does not, and the most important case is excluded: q=2q = 2 with F2\mathrm{F}_2 coefficients, which represents the (i−1)(i-1)-form Ising lattice gauge theory. We prove the theorem for q=2rq = 2^r with r≥1r \ge 1 and F2\mathrm{F}_2 coefficients. The representation-theoretic step is replaced by a transfer-matrix inequality, the classical positivity of the partition functions of 't Hooft's electric-flux sectors; read in the random-cluster representation, this inequality compares the probabilities of homological events. As a corollary, for the ferromagnetic (i−1)(i-1)-form Ising gauge theory on the 2i2i-dimensional torus (Wegner's model when i=2i = 2), the free energy of every nontrivial 't Hooft twist tends to 00 below the self-dual coupling and to infinity above it as the torus grows. For Bernoulli plaquette percolation (q=1q = 1) the characteristic-22 case remains open for i≥2i \ge 2; we describe obstructions to proving it, and on the 44-torus we prove a computer-assisted divisibility theorem for the classes of integral giant cycles just above p=1/2p = 1/2.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716219

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202645 pages
PDFView work

math.PR — Probability

Essential enhancements of site percolation in every dimension and on periodic lattices

Contributed by Tejasvi Singh Tomar

We prove Conjecture 1 of Balister, Bollobás and Riordan for site percolation on Zd\mathbb Z^d in every dimension d≥2d\ge2: for every essential enhancement, activated at any positive density, the enhanced configuration percolates for all p<pcp<p_c close enough to the critical probability pcp_c. Aizenman and Grimmett gave an argument for this in 1991, but Balister, Bollobás and Riordan found that its combinatorial step can fail. They proved the cases d=2,3d=2,3, outlined proofs for bond percolation on Zd\mathbb Z^d and for site percolation on the triangular lattice, and left the cases d≥4d\ge4 open. Near a site that is pivotal for a long connection, our proof reroutes the open path through a finite configuration in which the enhancement creates a connection, inside a ball that need not be centred at the pivotal site. A theorem valid in every dimension makes this possible unless the first and last sites of the path in the ball lie at a corner of the ball, and a mass-transport argument finds a ball where they do not. The method extends to site percolation on fourteen further periodic lattices, among them all Archimedean lattices other than the square lattice, and to bond percolation on the honeycomb lattice. The proof for Zd\mathbb Z^d uses no computer, parts of most lattice proofs are finite computer checks of local configurations, and the main theorems for Zd\mathbb Z^d and for nine of the lattices have been checked in the Lean proof assistant.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716333

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 2026109 pages
PDFView work

math.PR — Probability

Causal prediction of rare recovery responses and the optimal scale of observation time

Contributed by Man Huang

We determine the information and physical waiting needed to predict a rare intervention response with error smaller than its occurrence probability in a one-dimensional growth process with renewed Poisson interval catastrophes. Deletions of initial sources in macroscopic intervals define a mixed response, with all intervention arms sharing the same stationary past and future forcing. A fixed number of growing submacroscopic gaps determines its rare-event probability scale. We identify the response probability and amplitude, characterize when terminal extinction bits lose predictive information, and construct a gate that recovers this information from the recovery trajectory. For absolute and squared loss, a deterministic-age Bayes-risk expansion holds uniformly with additive error smaller than the rare-event probability. Our main waiting theorem covers every honest causal stopping rule, allowing the complete realized catastrophe history. Its average-time benchmark is the sum of each ordered gap length weighted by the extinction probabilities of preceding gaps. Prediction error smaller than the rare-event probability requires mean waiting divided by this benchmark to diverge; every prescribed diverging multiplier is achievable using actual recovery records. With gap scales n2/5n^{2/5} and n4/5n^{4/5} and integrated catastrophe tail Ax∼C/xA_x\sim C/x, deterministic observation requires age larger than the n4/5n^{4/5} scale, whereas a stopping rule achieves mean waiting O(n2/5log⁡n)O(n^{2/5}\log n). The proofs preserve the rare-event scale through weighted response approximation, risk transfer over arbitrary information fields, and posterior lower bounds on rare history branches.

Author comments: Complete English manuscript with Technical Supplement Appendices A–E. Full English–Chinese edition, sources and original MIT-licensed diagnostic code: https://doi.org/10.5281/zenodo.24138927. Mathematical content version 2026-11-11.2. Companion preprints: https://doi.org/10.5281/zenodo.23911961 and https://doi.org/10.5281/zenodo.23912425.

Primarily AI-generated textHuman understanding: some partscausal predictioninteracting particle systemsrare eventssequential observationspatial catastrophesstopping times
Nov 12, 202641 pages
PDFView work

math.PR — Probability

Finite-preparation response under heavy-tailed catastrophes: exact amplitudes and separation from Poisson coverage

Contributed by Man Huang

We determine the terminal response of a one-dimensional binary recovery process to a finite preparation history under independently renewed Poisson interval catastrophes. For regularly varying interval weights νr∼r−pL(r)\nu_r\sim r^{-p}L(r), p>3p>3, and fixed small positive intensities, we prove an exact leading response when preparation and observation durations grow proportionally. The main result expresses the response as an explicit functional of the actual recovery-front speeds accumulated along each fixed finite-stage preparation history and of the selected target-phase open density. Its weak-intensity second variation is a strictly positive quadratic form in every nonzero fixed signed temporal modulation, including equal-dose redistributions. A separate four-update theorem identifies local cooperation through an explicit positive equal-dose contrast for every nonzero interval law with finite first moment. These positive contrasts separate the process from conditional Poisson Boolean coverage with fixed grain kernels, a fixed environment distribution and affine intensity control, whose contrast is nonpositive at every finite time. As an effective extension, relative power-law tail bounds yield a conservative computable sufficient threshold valid at every later integer time. The core proof combines nonstationary front transfer, uniform background forgetting and exact resetting at intensity switches.

Author comments: Mathematical content and references follow Zenodo v1 (3 November 2026), https://doi.org/10.5281/zenodo.23912425. AI-use and verification-status declaration clarified; no mathematical results changed. Supplement and reproducibility archive: same DOI.

Primarily AI-generated textHuman understanding: some partsBoolean coveragefinite preparationinteracting particle systemsrecovery frontsregularly varying tailsspatial catastrophes
Nov 12, 202636 pages
PDFView work

math.PR — Probability

Closing the identification step in the GFF limit: Uniqueness of the zero-slope six-vertex phase for −1 ≤ Δ < 1/2

Contributed by Yan Ru Pei

For the six-vertex model with a=b=1a=b=1 and c∈(1,2]c\in(1,2], that is −1≤Δ<12-1\le\Delta<\frac{1}{2}, we prove that the plane measure, the limit of balanced torus measures, is the only translation-ergodic gradient Gibbs measure of slope zero, and hence the unique translation-invariant minimiser of the specific free energy. Both statements had been asserted by reference to Sheffield's uniqueness theory, which is proved for nearest-neighbour potentials; we show that for c≠1c\ne1 the six-vertex weights, which couple faces across the diagonals of each vertex, are not a nearest-neighbour potential in height coordinates. The proof extends Sheffield's cluster swapping to these diagonal interactions by means of residual energies on the diagonals, shows with the Lanford–Ruelle theorem for subshifts of finite type and a Burton–Keane argument that two distinct ergodic zero-slope phases are gradients of Gibbs measures on heights, and shows from the spin representation in the form given by Duminil-Copin, Kozlowski, Lammers and Manolescu that the plane measure is not. This supplies a step that we found missing in the chain of recent results on the Gaussian free field limit of the six-vertex height function. An unrefereed manuscript of OpenAI states the full-plane limit for every c∈(0,2]c\in(0,2]; for 2≤c<2\sqrt{2}\le c<2 it identifies a state built from nearly balanced sectors with the plane measure through the characterisation above. Our result gives that identification, given two properties of the state stated in the manuscript. We also check that the manuscript and the work of Averous, Duminil-Copin, He, Lammers and Manolescu concern the same measure, so that their convergence in domains holds, for c∈[1,2]c\in[1,2] and with constants depending on Δ\Delta, wherever the manuscript's full-plane theorem holds.

A mix of human-written and AI-generated textHuman understanding: some partsGaussian free fieldcluster swappinggradient Gibbs measuresheight functionsix-vertex modeluniqueness
Nov 11, 202633 pages
PDFView work

math.PR — Probability

An exact moment criterion for survival under renewed spatial catastrophes

Contributed by Man Huang

We prove an exact moment criterion for survival in a binary growth process subject to independently renewed spatial catastrophes. Occupied sites spread through a finite set of allowed increments on the integer lattice, and Poisson catastrophes with unbounded cube sizes empty all occupied sites in each affected cube. Under finite one-site hitting intensity, a positive finite-seed survival phase exists if and only if the cube-size measure has a finite moment of order one more than the spatial dimension. The divergent endpoint yields extinction at every positive intensity. The proof centres on a one-dimensional positive-phase construction for connected interval errors under a finite second moment. Extremal-path resampling gives a conditional correlation inequality, which controls exact interval insertion counts and a finite-history potential. Coordinate restriction and envelope covering then establish the criterion in every dimension. We also prove the bulk-to-seed reversal identity and extend the criterion to uniformly fat shapes. For the one-sided one-dimensional rule, the stationary hole density has a quadratic dilute expansion under the same second-moment condition. Its excess over independently eroded Poisson events is strictly positive at every positive intensity, with an explicit quadratic coefficient in the dilute limit.

Author comments: Based on Zenodo v1 (3 November 2026), https://doi.org/10.5281/zenodo.23911961. Mathematical text and references unchanged; portable font and provenance updates only. Original source and finite diagnostics: same DOI.

Primarily AI-generated textHuman understanding: some partsdependent percolationinteracting particle systemsprobabilistic cellular automataspatial catastrophessurvival criterion
Nov 11, 202617 pages
PDFView work

math.PR — Probability

Nonuniqueness of site percolation on nonamenable quasi-transitive graphs

Contributed by Yan Ru Pei

Benjamini and Schramm conjectured in 1996 that site percolation on every nonamenable quasi-transitive graph has pc<pup_c<p_u. We prove this in Hutchcroft's operator form: for Bernoulli site percolation on every connected, locally finite, nonamenable quasi-transitive graph, the critical two-point operator is bounded on ℓ2\ell^2, pc<p2→2≤pup_c<p_{2\to2}\le p_u, and in the standard monotone coupling infinitely many infinite clusters coexist at every parameter of a nondegenerate interval. Since bond percolation is site percolation on the line graph, this contains OpenAI's recent bond theorem. For unimodular automorphism groups we adapt OpenAI's proof: cut vertices replace bridges, a pruning lemma handles retained contact vertices, a rejection step controls the junctions created by opening a vertex, and pivotal corridors become induced paths. For nonunimodular groups we extend Tran and Nguyen's site argument from vertex-transitive to quasi-transitive graphs.

Author comments: 60 pages: main text pp. 1-28, appendices A-G. An earlier version is on Zenodo, doi:10.5281/zenodo.24023209; this version differs only in adding the companion paper's DOI to its bibliography entry. The proof uses three unrefereed inputs, listed in the introduction: OpenAI's manuscript on nonuniqueness of bond percolation (both cases), Section 5 of Tran and Nguyen, arXiv:2609.07026 (nonunimodular case), and the companion paper "Critical site percolation dies on (almost) every quasi-transitive graph", doi:10.5281/zenodo.24023188 (critical finiteness and the nonunimodular case).

A mix of human-written and AI-generated textHuman understanding: some partsBenjamini-Schramm conjecturenonamenable graphsnonuniquenessoperator normquasi-transitive graphssite percolation
Nov 10, 202660 pages
PDFView work

math.PR — Probability

Computer-assisted bounds 0.556921 <= p_c <= 0.6463 for site percolation on the square lattice

Contributed by David Niedbala Giraudin

Let p_c be the critical probability of Bernoulli site percolation on Z^2. We prove 0.556921 <= p_c <= 0.6463. The previous best rigorous bounds known to us are p_c >= 0.5567 (Ashton, 2026, extending van den Berg and Ermakov, 1996) and p_c <= 0.666894 (Wierman and Oberly, 2024). The lower bound uses the growth-process comparison of van den Berg and Ermakov with the exact posterior on the exploration tree. We reduce this posterior to a scalar interval recursion and explore the tree generation by generation, with a prescribed order among siblings. This passes the value 0.556788... that the same scalar computation gives when the order is not used, and the value 0.556788090 reported by Ashton as the limit of his relaxation. The upper bound uses the substitution method of Wierman, in two stages with 4x4 regions, from the line graph of Z^2 (site threshold 1/2) to Z^2. Both bounds are certified by short pure-Python programs in exact rational and integer arithmetic.

Primarily AI-generated textHuman understanding: no partscomputer-assisted proofcritical probabilitysite percolationsquare latticestochastic dominationsubstitution method
Nov 04, 20268 pages
PDFView work

math-ph — Mathematical Physics

Density coexistence for hard spheres with a long-range attractive pair interaction

Contributed by Qidong He

We prove low-temperature density coexistence for identical hard disks or hard spheres with a smooth, nonnegative, finite-range attractive Kac pair kernel. At every sufficiently large fixed inverse temperature and every sufficiently long finite interaction range, two translation-invariant Gibbs measures coexist, with densities near zero and maximal packing. The pressure is therefore nondifferentiable in chemical potential. The proof combines the contour construction of Lebowitz--Mazel--Presutti with a surface-pressure estimate for density bands near the two packing endpoints. A packing bound controls the fine density profile; centering the interaction makes its residual boundary contribution quadratic in the band width. Compatible near-packed configurations and conditional entropy then control the hard-core boundary contribution. These estimates allow the dense restricted ensemble to retain positional order and long-range correlations.

Primarily AI-generated textHuman understanding: no parts
Nov 02, 202621 pages
PDFView work

math-ph — Mathematical Physics

Area law for three-dimensional U(1) lattice gauge theory with the Wilson action at every coupling

Contributed by Tejasvi Singh Tomar

We prove that three-dimensional U(1) lattice gauge theory with the Wilson action confines static charges at every coupling. More precisely, for each β>0\beta>0 there are σ(β)>0\sigma(\beta)>0 and R1(β)<∞R_1(\beta)<\infty such that rectangular Wilson loops of sides R,T≥R1(β)R,T\ge R_1(\beta) satisfy ⟨cos⁡θC⟩≤exp⁡(−σ(β)RT+c(R+T))\langle\cos\theta_C\rangle\le\exp(-\sigma(\beta)RT+c(R+T)), uniformly in the finite box, with an absolute constant cc and an explicit lower bound on σ(β)\sigma(\beta). For the Villain action this is the theorem of G\"opfert and Mack. For the Wilson action it is cited as known but has remained open. The proof rests on a comparison. The Wilson plaquette weight is a mixture of Villain weights whose coupling has a very light upper tail. Hence, by Ginibre's inequality, the Wilson loop at coupling β\beta is at most an average, over a sparse Bernoulli set of frozen plaquettes, of the Villain loop at coupling KβK\beta, and frozen plaquettes are insulating walls for the monopole gas. A variational regularization, built on the smallest minimizer of a cut functional, freezes more plaquettes, which only increases the loop. It produces slit domains on which the multiscale analysis of G\"opfert and Mack, with wall fields graded by their periods around the handles, runs with uniform constants. On these domains the loop decays like the exponential of the minimal spanning area with frozen plaquettes free. A Peierls estimate shows that this area is at least (1−η)RT(1-\eta)RT outside an event of probability at most e−RT+O(R+T)e^{-RT+O(R+T)}, with η→0\eta\to0 as K→∞K\to\infty. We carry over the steps cited from Brydges\textendash Federbush and G\"opfert\textendash Mack with explicit changes and prove them in full in Part S4 of the supplementary material, including a tree-graph counting step of Brydges whose printed deduction is incomplete. As corollaries, we obtain the area law at every coupling for all closed subgroups of U(nn) containing the scalars, also with a Higgs field blind to the centre (as for U(2) with an adjoint Higgs field), and for the Georgi\textendash Glashow model at infinite Higgs coupling.

A mix of human-written and AI-generated textHuman understanding: all parts
Oct 26, 2026158 pages
PDFView work

math-ph — Mathematical Physics

One Cube Estimate Implies the Yang--Mills Mass Gap

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya, James Montgomery Lockwood, Tristan Romanov

We prove that four-dimensional lattice Yang--Mills theory with any compact simple gauge group has a unique infinite-volume state and a mass gap at strong coupling, and that one averaged estimate in a single cube of fixed physical size gives a mass gap to every continuum limit. For $\SU(2)$ the block variables approach the Haar measure in every representation as the coupling is tuned to the continuum, and this proves the estimate at the coarsest scale on every torus of side up to e2k/(17k)e^{2^k/(17k)} after kk blocking steps. The estimate along the whole tuning remains open.

Author comments: Retitled "One Cube Estimate Implies the Yang--Mills Mass Gap". Adds the labels and islands of Balaban's blocks, the averaged cube condition and its passage across scales, the smoothing along paths for SU(2), the metrics that compose across scales, the conditional chain for every compact simple group and a concluding section; every constant is proved by hand. Source, programs and Lean 4 certificate: https://github.com/creelie/4Y-M (release v4.37.0, doi:10.5281/zenodo.23992883). The paper does not prove the cube estimate along the whole continuum tuning or the existence of a nontrivial continuum limit, so it does not solve the Clay Millennium problem.

A mix of human-written and AI-generated textHuman understanding: all partslattice gauge theory; gauge fixing; Dobrushin uniqueness; mass gap
Oct 18, 2026385 pages
PDFView work

math.PR — Probability

Quantitative analysis of critical-window profiles for autocatalytic emergence

Contributed by Michael Mislan

The critical-window law for reflexively autocatalytic and food-generated (RAF) sets in the reversible binary-polymer model states that, when the mean number of reactions catalysed per molecule grows like λn\lambda n, the RAF probability converges to Sν(1−e−λ)S_\nu(1-\mathrm{e}^{-\lambda}), where SνS_\nu is the probability that ordinary reversible closure of the food set is unbounded in an infinite field of independently open reaction channels. The law is known for the ordered split-position catalogue (ν=sp\nu=\mathrm{sp}) and for the commuting-factor quotient catalogue (ν=qt\nu=\mathrm{qt}). It is an existence theorem: it names the limit but says nothing effective about its value, its shape near zero, or what a finite network actually does. This paper answers those three questions. For both profiles, a construction gives a terminating algorithm which, given rational openness aa and rational tolerance ε\varepsilon, returns a rational interval of width below ε\varepsilon containing Sν(a)S_\nu(a), with an explicit approximation error 1/m+(2L+1−2)(1−aL+1)r1/m+(2^{L+1}-2)(1-a^{L+1})^r for a computable seed length LL and record index rr, uniform on every openness interval bounded away from zero. The key estimate is a finite-cap record contraction proved without conditioning on survival and without independence between repair attempts. Second, tracking total word length along productive closure histories replaces a coefficient of order (Jr)\binom{J}{r} over enormous channel caps by Crν≤36r2r(r−1)/2C_r^\nu\le36^r2^{r(r-1)/2}, giving log⁡Sν(a)≤−log⁡2(1/a)/(2log⁡2)+O(log⁡(1/a))\log S_\nu(a)\le-\log^2(1/a)/(2\log2)+O(\log(1/a)) and exact certificates such as Sν(10−20)<10−629S_\nu(10^{-20})<10^{-629}. Third, at fixed word length nn the probability that some singleton RAF exists is exactly 1−(1−p)2481-(1-p)^{248} (split) or 1−(1−p)2341-(1-p)^{234} (quotient), so the finite RAF probability is linear in pp at zero while the limiting profile is flatter than every power; this order-of-limits effect is quantified with rational two-sided predictions and two fully explicit examples at n=16n=16. Further results give strict monotonicity of the profile, an effective global modulus of continuity, terminating inverse-probability brackets, and non-analyticity at zero. The effective evaluator, its error contract with the finite catalytic model and productive-history extraction are checked in Lean~4; the printed numerical bounds are checked by the accompanying replay script; the sharper counting theorem, the singleton law and the regularity results have conventional proofs and are labelled as such.

Primarily AI-generated textHuman understanding: some partsautocatalytic setscomputable analysiscritical windowfinite-size effectslow-intensity asymptotics
Oct 17, 202621 pages
PDFView work

math.PR — Probability

A nontrivial critical window for autocatalytic emergence in the binary polymer model

Contributed by Michael Mislan

The limiting probability is determined for a reflexively autocatalytic and food-generated (RAF) set in two reversible binary-polymer models. The models have the same molecules and food but distinguish reaction identities differently: the split-position catalogue retains ordered factorizations, whereas the quotient catalogue merges swapped factors exactly when they commute. With independent molecule--reaction catalysis, one mark shared by both directions, and mean catalysis fnf_n per molecule satisfying fn/n→λ>0f_n/n\to\lambda>0, the RAF probability converges in either model to Θν(λ)=Sν(1−e−λ),ν∈{sp,qt},\Theta_\nu(\lambda)=S_\nu(1-e^{-\lambda}),\qquad \nu\in\{\mathrm{sp},\mathrm{qt}\}, where SνS_\nu is the survival probability of infinite ordinary reversible food closure in the corresponding independent open-reaction field. Each profile is continuous and nondecreasing, lies strictly between zero and one at every finite positive intensity, and tends to zero and one at its two endpoints. Thus the entire linear scale is a nontrivial critical window, replacing the finite-step conjecture of Hordijk and Steel in the stated model. The common mechanism is uniform growth from a fixed supplied seed, followed by same-parameter richness and an exact law for complete catalytic pruning histories. A shared proof is given, including the explicit quotient transfer: deterministic closure and RAF equivalence project independent split marks to heterogeneous OR marks, rather than to the homogeneous quotient ensemble. The profiles satisfy Θsp(λ/2)≤Θqt(λ)≤Θsp(λ)\Theta_\mathrm{sp}(\lambda/2)\le\Theta_\mathrm{qt}(\lambda)\le\Theta_\mathrm{sp}(\lambda); productive food gateways give the conventional bounds Θsp(λ)≤1−e−32λ\Theta_\mathrm{sp}(\lambda)\le1-e^{-32\lambda} and Θqt(λ)≤1−e−30λ\Theta_\mathrm{qt}(\lambda)\le1-e^{-30\lambda}. The quotient gateway-conditioned bulk-factor limit is also identified. It concerns structural autocatalysis, without assertions about reaction kinetics or thermodynamic viability.

Primarily AI-generated textHuman understanding: some partsautocatalytic setsbinary polymer modelcritical windowreaction channelsreversible closure
Oct 16, 202617 pages
PDFView work

math.PR — Probability

An N−7/10N^{-7/10} Bound for the Finite-Size Bias of the Sherrington-Kirkpatrick Free Energy

Contributed by P. M. Aronow, Patrick Lopatto

For every fixed inverse temperature β>1\beta>1, we prove that the expected free energy per spin of the zero-field Gaussian Sherrington-Kirkpatrick model differs from its Parisi limit by at most CβN−7/10C_\beta N^{-7/10}. This improves the exponent 2/32/3 of our earlier work (arXiv:2609.09103). We also compare the bound with the finite-size correction of order N−3/4N^{-3/4} predicted by Franz, Parisi, and Ricci-Tersenghi, and with the strict improvement over 2/32/3 that would follow from the ideas in OpenAI's recently released manuscripts.

Primarily AI-generated textHuman understanding: some parts
Oct 12, 2026206 pages
PDFView work

math.PR — Probability

The Parisi Formula for the Edwards–Anderson Model in the High-Dimensional Limit

Contributed by P. M. Aronow, Patrick Lopatto

We study the Edwards–Anderson spin glass on the torus (Z/LZ)d(\mathbb{Z}/L\mathbb{Z})^d, with independent Gaussian couplings of variance 1/(2d)1/(2d) between nearest neighbors. We prove that, as d→∞d\to\infty, its free energy converges to that of the Sherrington–Kirkpatrick model, given by the Parisi formula, at every temperature and in every uniform external field, uniformly in the side length LL. The same holds on the hypercube {0,1}d\{0,1\}^d, and the ground-state energies converge to the Sherrington–Kirkpatrick ground-state energy.

Primarily AI-generated textHuman understanding: some partsparisi formulaspin glass
Oct 08, 2026139 pages
PDFView work

math.PR — Probability

The Negative Spherical Perceptron: Capacity, Isostatic Jamming, and Full Replica Symmetry Breaking

Contributed by P. M. Aronow, Patrick Lopatto

We study the negative spherical perceptron, a mean-field model of jamming with a nonconvex solution space. We establish the Parisi formula for its free energy and identify the capacity for every constraint density α>2\alpha>2. We also show that the jamming point is isostatic: optimal configurations have exactly NN contacts. For α\alpha slightly above two, we show that replica symmetry is lost at the de Almeida–Thouless margin through a continuous transition to full replica symmetry breaking. Further, we show that Gardner's formula overestimates the capacity by order (α−2)3(\alpha-2)^3.

Primarily AI-generated textHuman understanding: some partsperceptronspin glass
Oct 02, 2026357 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations