Browse

Probability

math.PR — Probability

math.PR RSS feed

Works in math.PR

94 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.ST — Statistics Theory

The planar data-selection constants F(2,n)=2n/(2n−1)F(2,n)=2n/(2n-1), including F(2,3)=6/5F(2,3)=6/5 and F(2,2)=4/3F(2,2)=4/3

Contributed by Samuil Petkov

For a finite multiset D⊂R2D\subset\mathbb{R}^2 let LD∗L_D^* be the least mean squared distance from a point to DD, and let LD∗(n)L_D^*(n) be the least such loss attained at the average of nn points selected from DD with repetition. Hanneke, Moran, Shlimovich and Yehudayoff asked for F(d,n)=sup⁡DLD∗(n)/LD∗F(d,n)=\sup_D L_D^*(n)/L_D^*. We prove F(2,n)=2n/(2n−1)F(2,n)=2n/(2n-1) for every n≥2n\ge2: every finite planar multiset satisfies LD∗(n)≤2n2n−1LD∗L_D^*(n)\le\frac{2n}{2n-1}L_D^*, with equality for 2n−12n-1 copies of (0,0)(0,0) and one copy of (1,0)(1,0). In particular F(2,3)=6/5F(2,3)=6/5, and F(2,2)=4/3F(2,2)=4/3 receives a short proof. The proof reduces to three support points by a mean-preserving Carathéodory argument and then exhibits an explicit random selection of nn support points, supported on one small triangle of the selection grid, whose second moment about the population weights is dominated by 12n−1\frac{1}{2n-1} times the categorical covariance. For n∈{2,3}n\in\{2,3\} we also give random selections attaining this second moment exactly.

Author comments: 6 pages. Determines F(2,n) for all n, resolving the d=2 row of Question 1 of the COLT 2025 open problem "Data selection for regression tasks" (Hanneke, Moran, Shlimovich, Yehudayoff).

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 16, 20266 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.PR — Probability

A certified upper bound for the beat the average game

Contributed by Tejasvi Singh Tomar

Let CC be the supremum of P[X1+X2+X3<2X4]\mathbb{P}[X_1+X_2+X_3<2X_4] over all probability measures on [0,∞)[0,\infty), where X1,…,X4X_1,\dots,X_4 are independent with the given law. Determining CC is Problem 6.39, the beat the average game, in the list of Georgiev, Gómez-Serrano, Tao and Wagner. Bellec and Fritz proved 0.4006953≤C≤673/16150.4006953\le C\le 673/1615 and conjectured that the lower bound, 0.4006953723…0.4006953723\ldots, is the exact value. We prove C≤0.40069634C\le0.40069634, less than 10−610^{-6} above the conjectured value. The proof applies Razborov's flag algebra method to samples of nine points. Since the points are independent, the positivity constraints of flag algebras hold for every single measure, so that no limit objects are needed. An exact certificate is checked in rational arithmetic, and the bound is also proved in the Lean 4 proof assistant, with Lean's kernel checking the certificate.

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

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202612 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

Certified upper bounds for the Chvátal–Sankoff constant

Contributed by Tejasvi Singh Tomar

Let γ2\gamma_2 be the Chvátal–Sankoff constant, so that the expected length of a longest common subsequence of two independent uniformly random binary strings of length nn is γ2n+o(n)\gamma_2n+o(n). Lueker proved γ2≤0.826280\gamma_2\le0.826280 with a finite automaton that reads a pair of strings as a sequence of minimal match pairs and remembers the last hh symbols of each string, for h=8h=8. We carry out his method up to h=13h=13 and prove γ2≤0.821963\gamma_2\le0.821963. For h=13h=13 the certificate lists 165,695,219,469165{,}695{,}219{,}469 states of the automaton, reduced by a symmetry. The bound rests on an explicit positive vector for the weighted transition matrix of the automaton; a checker rebuilds every transition with its own code and verifies the required inequalities in exact integer arithmetic. We also give a complete proof that the automaton accepts the truncated canonical decomposition of every pair of strings, the property on which the method depends. The bound γ2≤0.821963\gamma_2\le0.821963 is also proved in the Lean 4 proof assistant, with a computation evaluated by compiled code, and the bounds γ2≤0.825101\gamma_2\le0.825101, γ2≤0.824120\gamma_2\le0.824120, γ2≤0.823290\gamma_2\le0.823290 and γ2≤0.822579\gamma_2\le0.822579 for h=9h=9, 1010, 1111 and 1212 by formal proofs that are checked entirely by the Lean kernel.

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

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202611 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

Sharp Poisson approximation and second-order correction for long multiplicative runs

Contributed by Brice Pouly

Let ff be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least LL in [N,2N)[N,2N), with L=log⁡2N+O(1)L=\log_2N+O(1) and both signs included. The total variation distance to the Poisson law with nominal or exact mean has an explicit equivalent of order LN−2/3LN^{-2/3}, with a coefficient depending on N2−LN2^{-L} and L mod 3L\bmod3. After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power 4/34/3: for every fixed ε>0\varepsilon>0, its ℓ1\ell^1 error lies between constant multiples of N−4/3−εN^{-4/3-\varepsilon} and N−4/3+εN^{-4/3+\varepsilon}, uniformly in each fixed critical band. The leading correction comes from rational pairs. Keeping all channels up to a fixed height hh gives an explicit distance equivalent with power h/(h+1)h/(h+1), determined by the first omitted height. The third factorial cumulant has optimal power 41/3041/30. The proof expands around the exact Bernoulli marginals and stops at the first excluded dependent configuration. Arithmetic bounds for fixed configurations and a separate uniform tail estimate control the resulting positive boundary mass. Short square relations and a common algebraic curve bound the triple interactions; a fourth Charlier test detects the two-pair contribution that makes the quadratic exponent optimal.

Author comments: Initial Hexagon deposit of the published Zenodo edition (https://doi.org/10.5281/zenodo.24220727), including its technical companion in the same PDF. Lean formalization and reproducibility archive: https://doi.org/10.5281/zenodo.24220800. Mathematical source text is preserved; source packaging and navigation are adapted.

Primarily AI-generated textHuman understanding: no partsLean formalizationPoisson approximationPoisson–Charlier approximationarithmetic dependenciesfactorial cumulantslong runsrandom multiplicative functionstotal variation
Nov 15, 2026118 pages
PDFView work

math.RT — Representation Theory

A law of large numbers for infinitesimal characters of real reductive Lie algebras

Contributed by Andrew Salmon

We prove a law of large numbers for the infinitesimal characters of real reductive Lie algebras. Let π\pi be a unitary representation of a connected Lie group with reductive Lie algebra. For product states on the tensor powers of π\pi whose sites have uniformly bounded moments, for instance identical sites, the infinitesimal character divided by the number of sites concentrates at the spectrum of the limiting mean moment, with probabilities of deviation O(n−m)O(n^{-m}) for every mm. The generators may be unbounded and the group non-compact. For compact groups this recovers the laws of large numbers of Keyl and Werner and of Botero, Christandl and Vrana, which enter the asymptotic analysis of linear programming bounds for binary codes; spherical designs require the non-compact case. We give concrete examples arising from Howe dual pairs on bosonic Fock space.

Author comments: Comments welcome

Primarily AI-generated textHuman understanding: all parts
Nov 13, 202616 pages
PDFView work

math.PR — Probability

The Wasserstein cost of the Girsanov Theorem

Contributed by Simon Coste

This is an expository note on the asymptotics of the Wasserstein distance between the empirical measure of infinite-dimensional random paths and their common distribution. We present the classical proof for these asymptotics in the case of the Wiener measure, unifying quantization arguments from Dereich and coauthors or Boissard and Le Gouic, and we adapt it for It\^o diffusions sampled through the Girsanov theorem. More precisely, let Q\mathbb{Q} be the law of the solution of a stochastic differential equation with a bounded Lipschitz drift. Let W1,…,WnW_1,\ldots,W_n be independent Brownian paths, and let ZiZ_i be their Girsanov weights for Q\mathbb{Q}. The reweighted empirical measure $$\widehat\mu_n=\frac{\sum_{i=1}^n Z_i\delta_{W_i}}{\sum_{i=1}^n Z_i}$$ approximates Q\mathbb{Q} when nn is large. We prove that the Wasserstein cost Wpp(μ^n,Q)W_p^p(\widehat\mu_n,\mathbb{Q}) is of order (log⁡n)−p/2(\log n)^{-p/2}, in expectation and almost surely, for every fixed p⩾1p\geqslant1. In the Brownian case where Zi=1Z_i=1 these results show that log⁡nWp(μ^n,Q)\sqrt{\log n}W_p(\widehat\mu_n,\mathbb{Q}) is asymptotically sandwiched between 2λd\sqrt{2\lambda_d} and 42λd4\sqrt{2\lambda_d}, where λd\lambda_d is the first eigenvalue of the Laplacian operator in the unit ball. We provide numerical experiments to estimate the (conjectured) limiting constant in dimension d=1d=1.

Author comments: 16 pages. Full Lean formalization publicly available at gitlab.com/SimonCoste/wasserstein

Primarily human-written textHuman understanding: all parts
Nov 12, 202616 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

The L¹ Poincaré constant of the Hamming cube

Contributed by Tejasvi Singh Tomar

Let CC be the smallest constant such that E∣f−Ef∣≤C E∣∇f∣\mathbb{E}|f-\mathbb{E} f|\le C\,\mathbb{E}|\nabla f| for every real-valued function ff on every Hamming cube {−1,1}n\{-1,1\}^n, where ∣∇f∣|\nabla f| is the Euclidean length of (D1f,…,Dnf)(D_1f,\dots,D_nf) and Djf(x)=(f(x)−f(x(j)))/2D_jf(x)=(f(x)-f(x^{(j)}))/2. Ben Efraim and Lust-Piquard proved C≤π/2C\le\pi/2, the Gaussian case gives C≥π/2C\ge\sqrt{\pi/2}, and Ivanisvili, Li, van Handel and Volberg asked whether C=π/2C=\sqrt{\pi/2}. We prove that it is, with an explicit constant cn<π/2c_n<\sqrt{\pi/2} in dimension nn. The proof turns on an integral of first absolute moments of sums of independent biased random signs: we compute it exactly when the coefficients are nonnegative, and show, with a sampled Fejér kernel, that it can only grow when the coefficients are replaced by their absolute values. The equality C=π/2C=\sqrt{\pi/2} is also proved in Lean 4 with Mathlib.

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

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

math.PR — Probability

Lower bounds for the Beardwood–Halton–Hammersley constant

Contributed by Tejasvi Singh Tomar

Let β\beta be the Beardwood–Halton–Hammersley constant: the shortest tour through nn independent uniform random points in the unit square has length asymptotic to βn\beta\sqrt n almost surely. Dong and Cao proved β≥0.6421\beta\ge0.6421 from an inequality β≥5/8+∑k=3KCk\beta\ge5/8+\sum_{k=3}^{K}C_k, where CkC_k is an integral over configurations of kk points in the plane that form a connected graph when points at distance at most 11 are joined. For C3C_3, C4C_4 and C5C_5, sharper bounds come from a first-order expansion of the area of the union of the unit disks on boxes of configurations. For C6+⋯+C22C_6+\dots+C_{22}, which Dong and Cao did not use, a lower bound comes from comparing each point only with the three points before it in the order of their first coordinates. We obtain β≥0.6496\beta\ge0.6496, and β≥0.6508\beta\ge0.6508 if the exponential function of the C library used to evaluate the bound for C6+⋯+C22C_6+\dots+C_{22} has a relative error below 10−910^{-9}. The proofs are computer-assisted; the bound 0.64960.6496 is proved in Lean 4, with finite checks evaluated by compiled code, from the inequality of Dong and Cao and two statements about unions of disks that we prove but do not formalize.

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

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

math-ph — Mathematical Physics

Osterwalder–Schrader axioms for scalar QED3_3 in the Coulomb phase

Contributed by Mark Goldstein, Alfredo Guevara

King constructed the continuum, infinite-volume limit of three-dimensional scalar quantum electrodynamics, the U(1)U(1) (abelian) Higgs model, along Neumann–Dirichlet cubes. For his state at fixed photon mass we prove the Osterwalder–Schrader axioms: regularity E0′′\mathrm{E0}'' with absolute constants, invariance under the full Euclidean group, reflection positivity about every plane, symmetry, and the measure with its ergodic decomposition, on whose components the cluster axiom holds in all its forms. Rotation invariance is proved by comparing King's cubes with periodic tori carrying a smooth mass wall on two lattices whose orientations differ by arctan⁡(3/4)\arctan(3/4). With real scalar sources, the joint field of the curvature and the renormalised Wick square satisfies, on a tube of small Wick amplitudes, the axioms: regularity, invariance under translations and the lattice point group, Euclidean invariance of the joint field outside an exceptional set of couplings, reflection positivity for Wick amplitudes below a threshold, symmetry, and the measure with the cluster axiom in its weak form; above the threshold the Euclidean clause is open. The curvature results hold on King's whole coupling range; the Wick results hold under a one-sided sign clause of the Wick leg, which we prove on explicit coupling regions. The limit of vanishing photon mass is treated in a subsequent paper.

Author comments: Companion paper: Osterwalder–Schrader axioms for scalar QED$_3$ in the Higgs phase (hexagon:2611.00321). Project: https://github.com/marikgoldstein/scalar-qed-existence

Primarily AI-generated textHuman understanding: some parts
Nov 12, 2026291 pages
PDFView work

math.PR — Probability

Supersymmetric Analysis of a Random Band Matrix at Criticality, Volume I

Contributed by Patrick Lopatto

We study the N×NN \times N complex Hermitian Gaussian band matrix whose variance profile is the inverse of I−W2ΔI - W^2 \Delta, where Δ\Delta is the Neumann Laplacian on {1,…,N}\{1, \dots, N\}, in the critical regime W2≍NW^2 \asymp N. We prove that, for energies EE in a neighborhood of zero, the unfolded eigenvalue process converges to a stationary point process, whose law depends only on the limit XX of N/((4−E2)W2)N/((4 - E^2) W^2) and is given by the partition functions of a supersymmetric sigma model on an interval. We also determine the macroscopic law of the mass of an eigenvector selected near a given energy. Its density is the normalized exponential of a Brownian motion with drift, under the law tilted by its total mass; the same law describes the eigenvectors of the critical one-dimensional random Schrödinger operator. Further, we compute the limits of the two-energy correlations of the local densities of states at all pairs of interior sites, of the mean eigenvector profile at the scale of single sites, and of NN times the mean inverse participation ratio, which is 2+2X/32 + 2X/3. As X→0X \to 0 and X→∞X \to \infty, we recover the pair statistics of the GUE and of a Poisson process, and in the localized limit we obtain an explicit random shape for the eigenvectors. The number variance in a window of length LL grows like XL\sqrt{XL} as L→∞L \to \infty at every fixed XX, and we describe the crossover to Poisson statistics in windows of length of order XX. Several of these results confirm predictions that physicists obtained from the sigma model. The proof starts from the supersymmetric representation of averages of ratios of characteristic polynomials, which for this profile is a transfer operator on a one-dimensional chain. We show that the transfer chain converges to the heat semigroup of the sigma model, whose noncompact direction produces the Brownian motion in the eigenvector law.

Primarily AI-generated textHuman understanding: no parts
Nov 12, 2026179 pages
PDFView work

math.PR — Probability

Supersymmetric Analysis of a Random Band Matrix at Criticality, Volume II

Contributed by Patrick Lopatto

We study the N×NN \times N complex Hermitian Gaussian band matrix whose variance profile is the inverse of I−W2ΔI - W^2 \Delta, where Δ\Delta is the Neumann Laplacian on {1,…,N}\{1, \dots, N\}, in the critical regime W2≍NW^2 \asymp N. We prove that, for energies EE in a neighborhood of zero, the unfolded eigenvalue process converges to a stationary point process, whose law depends only on the limit XX of N/((4−E2)W2)N/((4 - E^2) W^2) and is given by the partition functions of a supersymmetric sigma model on an interval. We also determine the macroscopic law of the mass of an eigenvector selected near a given energy. Its density is the normalized exponential of a Brownian motion with drift, under the law tilted by its total mass; the same law describes the eigenvectors of the critical one-dimensional random Schrödinger operator. Further, we compute the limits of the two-energy correlations of the local densities of states at all pairs of interior sites, of the mean eigenvector profile at the scale of single sites, and of NN times the mean inverse participation ratio, which is 2+2X/32 + 2X/3. As X→0X \to 0 and X→∞X \to \infty, we recover the pair statistics of the GUE and of a Poisson process, and in the localized limit we obtain an explicit random shape for the eigenvectors. The number variance in a window of length LL grows like XL\sqrt{XL} as L→∞L \to \infty at every fixed XX, and we describe the crossover to Poisson statistics in windows of length of order XX. Several of these results confirm predictions that physicists obtained from the sigma model. The proof starts from the supersymmetric representation of averages of ratios of characteristic polynomials, which for this profile is a transfer operator on a one-dimensional chain. We show that the transfer chain converges to the heat semigroup of the sigma model, whose noncompact direction produces the Brownian motion in the eigenvector law.

Primarily AI-generated textHuman understanding: no parts
Nov 12, 2026422 pages
PDFView work

math.CA — Classical Analysis and ODEs

Some positivity properties of Riemann Ξ\Xi under smoothing

Contributed by Suvrit Sra

We show that smoothing the zeros of the Riemann Ξ\Xi-function makes it easy to establish positivity properties that are otherwise hard (as they are equivalent to the Riemann hypothesis). Specifically, we smooth each zero with a small density centered at it, and then test the impact of this smoothing on complete monotonicity (CM) of the heat sum H(t)=∑ρe−tzρ2H(t)=\sum_\rho e^{-tz_\rho^2} over the zeros 12+izρ\tfrac12+iz_\rho. A sufficiently wide density quickly implies CM of the smoothed heat sum. We bound the width (i.e., half-variance) the density needs using increasingly precise facts about the zeros. If we only use that they lie in the critical strip, half-variance 1/81/8 suffices; the primes lower this width to π2/288\pi^2/288; and zeros verified through height TT further lower it to π2/(8log⁡2T)\pi^2/(8\log^2T) asymptotically. Ultimately, however, smoothing seems to be of limited utility: despite the CM result, the smoothed reciprocal laws of Ξ\Xi are not even log-concave, unlike the unsmoothed ones.

A mix of human-written and AI-generated textHuman understanding: some partsGaussian smoothingPolya frequencyRiemann Xicomplete monotonicitygeneralized Laguerre inequalitieslog-concavityzeta zeros
Nov 12, 202635 pages
PDFView work

math-ph — Mathematical Physics

Osterwalder–Schrader axioms for scalar QED3_3 in the Higgs phase

Contributed by Mark Goldstein, Alfredo Guevara

We study scalar quantum electrodynamics in three dimensions (QED3_3) in its Higgs phase: the three-dimensional lattice abelian Higgs model in unitary gauge, with the Villain action, on lattices whose spacing tends to zero with canonically scaled couplings. At each spacing we construct infinite-volume states, as limit points of the periodic states and as limits of states in finite boxes; they carry the lattice symmetries, reflection positivity and bounds uniform in the volume. For the smeared curvature and bounded functions of the density, the generating functionals converge along a subsequence of spacings to a translation-invariant limit functional with the continuity required for the Osterwalder–Schrader reconstruction. For the limits built on the box states, and on the periodic states along dyadic sequences of sides, the limit curvature field satisfies the axioms OS0–OS3, with invariance under the full Euclidean group. The cluster axiom OS4 is proved in a weak form, on almost every ergodic component. The tools are Gaussian domination of the Villain curvature, Ginibre inequalities and reflection positivity.

Author comments: Companion paper: Osterwalder–Schrader axioms for scalar QED$_3$ in the Coulomb phase. Project: https://github.com/marikgoldstein/scalar-qed-existence

Primarily AI-generated textHuman understanding: some parts
Nov 12, 2026205 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-ph — Mathematical Physics

Notes on Wasserstein distance and the JT gravitational ensemble

Contributed by Ville Samuli Keränen

This note completes the study of the Boltzmann–Wasserstein (BW) distance, an optimal-transport metric on quantum theories, begun in a companion paper (arXiv:2606.01296). There the distance was evaluated between macroscopically different theories; here we take the opposite limit, two independent draws of the JT-gravity ensemble, which are identical at the classical level. The distance is computable and is controlled by the connected spectral form factor: the ramp, the double-trumpet wormhole, regulated by the plateau, the spectral discreteness. The mean is exponentially small, ⟨W2⟩∼S0 e−S0\langle \mathcal{W}^2\rangle \sim S_0\, e^{-S_0}, whereas uncorrelated (Poisson) levels would give an unsuppressed O(1)O(1) distance: the self-distance is a sharp diagnostic of spectral chaos. As a metric, the BW distance renders the ensemble a point cloud: exponentially small, strongly anisotropic, its leading principal axis a coherent “breathing” deformation of the low-energy spectrum. Its effective dimension grows asymptotically as Deff≃0.42 S02D_{\mathrm{eff}} \simeq 0.42\, S_0^2, so the distance self-averages, its relative width shrinking as std/mean∼1/S0\mathrm{std}/\mathrm{mean} \sim 1/S_0. At low temperatures it localizes on the Airy edge, where a single Tracy–Widom mode dominates and self-averaging fails. We test the picture with exact-diagonalization GUE and SYK simulations: in GUE the effective dimension grows logarithmically at every temperature and is predicted at finite NN, with no free parameters, by the same covariance; unfolded SYK exhibits the predicted anisotropy and mode structure of the cloud. Together with the companion result, this fixes the resolution of the metric: the microstate rigidity computed here is the noise floor beneath a macroscopic difference between theories.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202637 pages
PDFView work

math.PR — Probability

The Ultimate Matching Theorem

Contributed by Michael Goldman, Francesco Grotto, Dario Trevisan

Let X1,…,XNX_1,\dots,X_N be independent uniform points in the unit square, matched either to an evenly spread deterministic configuration or to a second independent sample. For exponents α1,α2>2\alpha_1,\alpha_2>2 with 1/α1+1/α2=1/21/\alpha_1+1/\alpha_2=1/2, we prove that with probability tending to one a single permutation controls the jjth coordinate displacements in the exponential Orlicz norm of exponent αj\alpha_j, at the scale log⁡N/N\sqrt{\log N/N}, for both j=1,2j=1,2. This settles Talagrand's Ultimate Matching Conjecture for all pairs of finite critical exponents. The proof constructs, on the flat torus, a current whose divergence is Gaussian white noise projected on a dyadic grid and whose coordinates have the critical anisotropic exponential Orlicz bounds, and transfers it to matching through a primal optimal-transport reduction. At the hard endpoints (2,∞)(2,\infty) and (∞,2)(\infty,2) the conjecture fails: a Brownian local-time construction shows that the normalized optimal matching cost diverges in probability.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202670 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

Stochastic Connections on Surface Bundles

Contributed by Zhenyu Sun

We construct local stochastic connection dynamics on arbitrary principal bundles over closed oriented Riemannian surfaces. For each smooth reference connection, the bare additive spatial heat approximations of the Yang–Mills–DeTurck equation converge to a maximal local strong Markov family in a separable negative Hölder space. A finite Gaussian enhancement defines the singular products, and cancellation of the total logarithmic mass identifies the limiting equation. Rough comparison gauges and predictable rotations of the Wiener noise identify the local orbit laws for different references. The finite quadratic tensor anomaly vanishes after the two-dimensional Yang–Mills contraction, with the finite normalisation fixed by the spatial heat approximation. Continuing through bounded representatives gives a reference-independent maximal local strong Markov family on the full rough orbit space. Gaussian line primitives have every Hölder exponent below one on bounded regular curve families and define non-Abelian Young parallel transport. On a dense, gauge-invariant Borel full-heat trace domain, polygonal holonomies separate rough gauge orbits, admit Borel representative maps, and recover the bundle class. The orbit dynamics has continuous holonomy paths on this domain, and the regularised holonomies converge uniformly on bounded regular curve families and compact surviving positive-time intervals. We also prove regularisation-independent convergence of first-order Gaussian currents after time integration, including a harmonic example of infinite variation and zero quadratic variation. At fixed regularisation scale, the field-dependent covariant heat approximation has classical solutions and an explicit Itô correction in Coulomb coordinates. In every Abelian sector, the quotient diffusion is global, reference independent, and reversible with an explicitly identified unique invariant law.

A mix of human-written and AI-generated textHuman understanding: some partsGaussian currentsStochastic Yang–Millsholonomyprincipal bundlesreference connectionsregularity structures
Nov 11, 2026140 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

Quartic exponential matching in the unit square

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Take two independent samples of nn uniform points in the unit square. We prove that, with probability at least one half, the points can be paired so that the average of the exponential of the fourth power of the normalized pair distance is at most two. The distance normalization is Llog⁡n/nL\sqrt{\log n/n}, with LL an absolute constant. One pairing therefore satisfies both coordinate inequalities in the symmetric (4,4)(4,4) case of Talagrand's matching problem. The argument first controls a vector field transporting smoothed point densities, and then converts that control to a pairing. The main estimate comes from a Gaussian construction whose successive partitions depend only on noise already revealed; a correction using the classical bottleneck matching preserves the required density balance.

Primarily AI-generated textHuman understanding: all partsTalagrand matching problemgeometric probabilityrandom matching
Nov 11, 202613 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.NT — Number Theory

Cumulative Prime Sums and Riemann Zeros: A fine grid, its ripple, and a family of prime races

Contributed by Antonio Mennillo

Summing the primes one after another and taking logarithms gives an increasing sequence of real numbers, σm=log⁡Spm\sigma_m=\log S_{p_m} with SN=1+∑p≤NpS_N = 1+\sum_{p\le N}p, which becomes exponentially dense. The ordinates γn\gamma_n of the zeros of the Riemann zeta function fall on this grid with tiny errors: 1.4⋅10−31.4\cdot10^{-3} at the first zero, 2.4⋅10−72.4\cdot10^{-7} at the fifth, 3⋅10−173\cdot10^{-17} at the twentieth. Part I explains why. The cell of the grid containing a height tt has width (1+o(1))t e−t/2(1+o(1))\sqrt t\,e^{-t/2} (Step Theorem), and every real t>log⁡3t>\log 3 has a node above it within that width, by an argument going back to Bertrand's postulate (Covering Theorem). The precision observed at the zeros is therefore the resolution of the grid, and the same precision holds at every height (Genericity Principle). We compute the first-crossing primes NnN_n with certification up to n=20n=20 and test, in a protocol fixed before the computation, whether the zeros sit closer to the nodes than a generic height. Neither the mean distance to the nearest node (0.2460.246 against 0.2500.250, p=0.92p=0.92) nor the distribution of the position within the cell (Kolmogorov–Smirnov, p=0.79p=0.79) departs detectably from the generic case, and an integer grid used as control behaves in the same way. We also correct the half-exponent law by a factor t′/t\sqrt{t'/t}. Part II shows where the zeros are actually visible. They are not in the position of the nodes but in the ripple: the deviation of the grid from its mean curve B(x)=1+li(x2)−li(4)B(x)=1+\mathrm{li}(x^2)-\mathrm{li}(4). This ripple is a sum of pure oscillations, one per zero; its spectrum shows a peak at each of the first 13 ordinates, with the amplitude predicted by the explicit formula. Under RH the ripple has size e−t/4e^{-t/4} on the grid, much larger than the cell e−t/2e^{-t/2}, and RH is equivalent to this decay rate. The ripple is not centred: on [103,108][10^3,10^8] the sum of the primes stays below li(x2)\mathrm{li}(x^2) for about 97% of logarithmic time, and it first exceeds it at x=109x=109. We place this in a one-parameter family of prime races, ∑p≤xpa\sum_{p\le x}p^a against li(xa+1)\mathrm{li}(x^{a+1}), and prove that under RH the normalized error has mean −1/(2a+1)-1/(2a+1), coming from the squares of the primes. Under RH and LI the limiting logarithmic density of the set where the race is ahead is given by a Rubinstein–Sarnak formula; it moves from 2.6⋅10−72.6\cdot10^{-7} (counting the primes, a=0a=0) to 0.060.06 (summing them, a=1a=1) and tends to 1/21/2 as a→∞a\to\infty, at the rate 12−δa∼1/(2πAlog⁡(A/2π))\tfrac12-\delta_a\sim1/\bigl(2\sqrt{\pi A\log(A/2\pi)}\bigr) with A=a+12A=a+\tfrac12. At a=−1/2a=-1/2 the bias becomes the 12log⁡log⁡x\tfrac12\log\log x of the weighted counting functions of Aoki and Koyama. All theorems are formalized in Lean 4, with the classical results they use as explicit hypotheses.

A mix of human-written and AI-generated textHuman understanding: some partsChebyshev biasLean 4Riemann zerosexplicit formulaprime races
Nov 06, 202629 pages
PDFView work

math.CO — Combinatorics

A new proof of van der Waerden's inequality, and beyond

Contributed by Suvrit Sra

We give a new, self-contained proof of van der Waerden's permanent inequality via a monotone-averaging argument. Specifically, we show that the minimum total correlation of a random permutation with prescribed doubly stochastic marginals never decreases when two rows or two columns of the marginal matrix are averaged. This quantity is largest at the uniform matrix, which yields van der Waerden's bound. The monotone-averaging rests on the quadratic Alexandrov–Fenchel inequality, which lets us extend the argument to many other problems. In this way we also prove the Friedland–Tverberg inequalities and Gurvits's coefficient bound for Lorentzian polynomials.

A mix of human-written and AI-generated textHuman understanding: all partsAlexandrov-Fenchel inequalityFriedland-Tverberg inequalityLorentzian polynomialscapacitydoubly stochastic matricesentropymixed volumespermanenttotal correlationvan der Waerden inequality
Nov 05, 202631 pages
PDFView work

math.PR — Probability

THE CRITICAL CAPACITY OF THE HOPFIELD MODEL

Contributed by Yuwen Zhou

Abstract. We prove that the critical capacity of the Hopfield model at zero temperature lies in [0.138198129, 0.13820106]. The best rigorous lower bound was 0.113, and our lower end exceeds the published one-step and two-step replica symmetry breaking values. The capacity is the supremum of the loads at which the free energy at fixed overlap with one pattern has a well. At every positive temperature, we give a variational formula for this free energy and show that binary patterns and Gaussian rows have the same wells, which characterizes the capacity. The proof builds on the Hamilton–Jacobi solution of the model by Ali, Boursier, Chen, Ho, Issa and Mourrat, and on a

Primarily AI-generated textHuman understanding: some partsHopfield modelinterval arithmeticparisi formulaspin glassesstorage capacity
Nov 05, 202657 pages
PDFView work

math.NT — Number Theory

Derivatives of Hardy's function at close pairs of zeros and an exact unitary constant π2/15\pi^2/15

Contributed by Jaskirat Singh

Let γn<γn+1\gamma_n<\gamma_{n+1} be consecutive ordinates of zeros of ζ(12+it)\zeta(\tfrac12+it) with normalized gap sns_n. We study the derivatives Z′(γn)Z'(\gamma_n), Z′(γn+1)Z'(\gamma_{n+1}) of Hardy's function at close pairs. For the circular unitary ensemble we prove that the conditional variance of log⁡∣Λ′(θ1)∣−log⁡∣Λ′(θ2)∣\log|\Lambda'(\theta_1)|-\log|\Lambda'(\theta_2)| at adjacent eigenangles with normalized gap ss satisfies Var⁡=cNs2(1+o(1))\operatorname{Var}=c_N s^2(1+o(1)) as s→0s\to0, with the exact value cN=π215(1−4N2)c_N=\frac{\pi^2}{15}\bigl(1-\frac{4}{N^2}\bigr), so that c∞=π2/15c_\infty=\pi^2/15, which we call the Singh constant. The proof reduces the problem through a Cayley transform to the Hua ensemble and closes it with two loop equations. We state a conditional theorem transferring the constant to the zeta function under the Riemann Hypothesis, a local GUE hypothesis and a tail bound, and we formulate a conjecture on the size of Z′Z' at close pairs. Numerical evidence from Odlyzko's tables up to zero number 102210^{22} agrees with the predictions. This paper is a revised and expanded version of the Zenodo record doi:10.5281/zenodo.23899228.

Author comments: v2: Section 1 now lists fourteen Singh Lemmas, each labeled proved (6, 8, 45), conditional (7, 27, 42, 44, 46, 48, 54, 67) or numerical (5, 51, 57). The unitary pi^2/15 constant and Hua moments are credited as known results, Lemma 20 is credited to Soundararajan and Milinovich, and method credits and an explicit transfer hypothesis for Lemma 67 are added.

A mix of human-written and AI-generated textHuman understanding: all partsHardy Z-functionRiemann Zeta Functioncircular unitary ensemblerandom matrix theoryzero spacing
Nov 05, 20269 pages
PDFView work

math.NT — Number Theory

Arcs of Π(1+z^p): prime races, the Gaussian core, Dirichlet L-functions and a certified solver for Subset Sum

Contributed by Antonio Mennillo

The subsets of {1}∪{p≤N}\{1\} \cup \{p \le N\} reach every integer between 0 and their total, by Bertrand's postulate, so deciding whether a target is a subset sum of the primes is trivial. Counting the solutions is not: the count carries the arithmetic of the primes. We study the generating function FN(z)=Π(1+zw)F_N(z) = \Pi(1 + z^w) on the unit circle and follow one object, the arc at a rational a/qa/q, through three settings. For the primes, the centre of the arc a/qa/q rises above the sea of the minor arcs exactly when q=2k(k≥2)q = 2^k (k \ge 2) or q=2pjq = 2p^j, with excess Λ(q/2)/φ(q)\Lambda(q/2)/\varphi(q), and the neighbourhoods of all the other arcs are bounded uniformly in qq; Theorem E gives the expansion arc by arc. The height of an arc is a race of the primes modulo qq with weights log⁡∣cos⁡(πra/q)∣\log |\cos (\pi ra/q)|. By Landau's theorem a one-sided bound on it is equivalent to GRH for the even characters it sees, unconditionally at q=8q = 8, 10 and 14, where the zero-free segments it needs are certified; at q=14q = 14 the race changes sign infinitely often. The principal arc carries ζ\zeta in the centre and width of its Gaussian. For arbitrary weights, the arcs become the decision rule of a Subset Sum solver that reads them on the original weights and ends with a meet-in-the-middle filtered by a random residue class. Every answer it returns is verified. The dummy weights of HURS explain why the reading is exact: they blur the counts by a flat window, and the blur is invertible on counts, though not on reachable sets. On random weights of bb bits the method has rigorous guarantees, in time 2b/2+o(b)2^{b/2+o(b)} and, with the filter, 2b/3+o(b)2^{b/3+o(b)}, resting on a local limit theorem uniform in the size of the weights and on a concentration bound for signed subset sums. Finally, the solver is read inside a general theory of constraint propagation, in which every network factors as T=Tcomp∘TstructT = T_{\mathrm{comp}} \circ T_{\mathrm{struct}}.

A mix of human-written and AI-generated textHuman understanding: some partsDirichlet L-functionsGRHSubset Sumcircle methodconstraint propagationlocal limit theoremmeet-in-the-middleprime races
Nov 04, 202662 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.PR — Probability

Stationary diffusion on nonnegatively curved graphs

Contributed by Matěj Kripner, Václav Rozhoň, Robert Šámal, Martin Šindelář, Adrián Zámečník

Lazy random walk on a bounded-degree graph of nonnegative Ollivier–Ricci curvature has diffusive second moment and Gaussian upper tails when started in stationarity. If the maximum degree is DD, then Ed(X0,Xn)2≤4Dn\mathbb E d(X_0,X_n)^2\le4Dn, with optimal order of dependence on DD. The results also hold for stationary random rooted infinite graphs. The proof combines known heat-kernel total-variation decay with a reversible energy identity for the conditional mean displacement. Its exponential form controls variation between starting vertices; martingale concentration then controls the walk itself.

Primarily AI-generated textHuman understanding: some partsOllivier-Ricci curvaturerandom walksreversibilitystationary displacement
Nov 04, 202612 pages
PDFView work

math.IT — Information Theory

Least-Atom Extremizers for Resampling Noise

Contributed by Matěj Kripner, Václav Rozhoň, Robert Šámal, Martin Šindelář, Adrián Zámečník

A single least-mass atom determines the extremal behavior of resampling noise on a finite probability space. A fixed-moment comparison gives the sharp generalized Samorodnitsky inequality for every 1<q<21<q<2 through one scalar curve, and identifies all nonconstant scalar extremizers. The same principle determines every LpL^p-to-LqL^q resampling norm for 1<p<q<∞1<p<q<\infty, resolving a conjecture of Cao, Fan, Han, Qiu, and Wang. The sharp hypercontractive parameter increases strictly with the least atom. The uniform-binary phase diagram is explicit, and product equality cases are classified for every nonuniform reference law and for the uniform binary law.

Primarily AI-generated textHuman understanding: some partsRenyi divergenceSamorodnitsky inequalitieshypercontractivityleast-atom extremizersresampling noise
Nov 04, 202620 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.PR — Probability

The Macdonald (q,t)(q,t)-permanent II: Probability laws and their regions of validity

Contributed by Suvrit Sra

The Macdonald (q,t)(q,t)-permanent replaces the constant cycle weight of the Vere-Jones α\alpha-permanent by (1−tk)/(1−qk)(1-t^k)/(1-q^k) for a cycle of length kk. We determine which of the probability laws built on the α\alpha-permanent survive this deformation, and where. The scalar gamma-type law survives on the whole parameter square, but the matrix law, a compound Wishart matrix, is more fragile. We prove that it exists in every dimension exactly when t∈{0,q,q2,…}t\in\{0,q,q^2,\ldots\}, and in dimension two exactly when t≤qt\le q. We conjecture that in each fixed dimension the matrix law exists exactly on the region that we show to be necessary, a qq-analogue of Gindikin's theorem.

A mix of human-written and AI-generated textHuman understanding: some partsCox processMacdonald permanentSchur measurealpha-permanentcomplete monotonicitycompound Wishart matrixinfinite divisibilityloop soupmatrix Laplace transform
Nov 02, 202627 pages
PDFView work

math.RA — Rings and Algebras

A Koteljanskii inequality for permanents

Contributed by Suvrit Sra

We prove a permanental analogue of Koteljanskii's inequality. If AA is an inverse MM-matrix that becomes symmetric after a positive diagonal similarity, then per(AS∪T) per(AS∩T)≥per(AS) per(AT)\mathrm{per}(A_{S\cup T})\,\mathrm{per}(A_{S\cap T})\ge\mathrm{per}(A_S)\,\mathrm{per}(A_T) for all S,T⊆[n]S,T\subseteq[n], where ASA_S is the principal submatrix indexed by SS. The proof expresses permanents as moments of a complex Gaussian vector and uses Ginibre's correlation inequality. Finally, an explicit counterexample shows that symmetry cannot be dropped.

A mix of human-written and AI-generated textHuman understanding: all partsFKG inequalityKoteljanskii inequalityM-matricescomplex Gaussianspermanents
Nov 02, 20269 pages
PDFView work

math.CO — Combinatorics

The qq-Foulkes problem II: Schur positivity with high probability

Contributed by Suvrit Sra

Bergeron's qq-analog of Foulkes' conjecture asserts that (Hb[Ha]−Ha[Hb])/(1−q)(H_b[H_a]-H_a[H_b])/(1-q) is Schur positive for a≤ba\le b, where HnH_n is the (modified) Hall--Littlewood polynomial. We view this conjecture probabilistically: on each irreducible representation of SabS_{ab}, the two plethysms induce degree distributions, and positivity means that the first is stochastically smaller than the second. We prove that, for a random (Plancherel) irreducible representation and a degree sampled from its graded multiplicity, the corresponding coefficient is negative with probability at most Cexp⁡(−c(ab)1/3)C\exp(-c(ab)^{1/3}), uniformly in a≤ba\le b. Consequently, the qq-Foulkes conjecture holds after deleting a fraction at most Cexp⁡(−c(ab)1/3)C\exp(-c(ab)^{1/3}) of each of the two graded modules. Additionally, we show that exact conditional means and variances yield complete positivity for explicit width and height families.

A mix of human-written and AI-generated textHuman understanding: some partsMacdonald polynomialPlancherel measureSchur positivityplethysmq-Foulkes conjecturestochastic order
Nov 02, 202632 pages
PDFView work

math.PR — Probability

Beyond Small Balls: A Determinant Inequality for Functions of Matrix Gaussian Series

Contributed by Suvrit Sra

We prove a functional extension of Gaussian operator-norm small-ball inequalities. Let X=∑i=1dgiBiX=\sum_{i=1}^d g_iB_i, where g∼N(0,Id)g\sim N(0,I_d), the matrices Bi∈Rd×dB_i\in\mathbb{R}^{d\times d} are symmetric, and ∑iBi2⪯Id\sum_iB_i^2\preceq I_d. For every even log-concave f ⁣:R→[0,∞)f\colon\mathbb{R}\to[0,\infty), we obtain Edet⁡f(X)≥(Ef(κG))d\mathbb{E}\det f(X)\ge(\mathbb{E} f(\kappa G))^d at dilation κ=13/5\kappa=13/5, where GG is standard Gaussian. The proof reduces each function to one small-ball estimate, obtained from matrix-weighted Poincaré inequalities, and controls the rest by averages over the spectrum. We give an equivalent entropy formulation. An explicit counterexample shows that no universal dilation below π/2\sqrt{\pi/2} can work; we conjecture that this value is optimal.

A mix of human-written and AI-generated textHuman understanding: all partsdeterminant inequalitylog-concave functionsmatrix Gaussian seriesrandom matricessmall-ball probabilities
Nov 02, 202630 pages
PDFView work

math.PR — Probability

Upper bounds for the Chvátal–Sankoff constants γk\gamma_k, k≥3k\ge3

Contributed by David Niedbala Giraudin

Lueker (J. ACM 56(3), 2009) constructed a family of finite-state machines Mh\mathcal{M}_h whose associated transfer matrices yield upper bounds on the Chvátal–Sankoff constants γk\gamma_k, and proved (his Theorem 3.26) that these bounds converge to γk\gamma_k for every alphabet size kk. He published values only for k=2k=2. For k≥3k\ge3 the best upper bounds we were able to find in the literature in September 2026 were still those of Dančík's 1994 thesis: subsequent work generalising Lueker has generalised his Section 2, the lower bound. We implement Mh\mathcal{M}_h for arbitrary kk. One ingredient has no binary analogue — the generating function of a truncation class when both sides of a minimal match pair are truncated — and we derive it. We then give a reduction by relative forms under which the transition multiplicities of the transfer matrix are falling factorials in kk; one alphabet-free construction consequently determines the exact matrix for every kk. We obtain improved upper bounds for k=3,…,15k=3,\dots,15, each supported by a Collatz–Wielandt certificate verified in exact rational arithmetic, among them γ5≤0.645033\gamma_5\le0.645033. A note added on 31 October 2026 compares these values with those of a repository made public by L. Jack on 25 October 2026.

Primarily AI-generated textHuman understanding: no partsChvátal–Sankoff constantsCollatz–Wielandt certificateslongest common subsequencetransfer matrices
Nov 02, 20267 pages
PDFView work

math.MP — Mathematical Physics

Riordan lattice paths counted by area

Contributed by Ilmar Gahramanov

We study Riordan paths enumerated by the area between the path and the axis. We show that the generating function satisfies a qq-Riccati equation and can be written in a closed form as a ratio of basic hypergeometric series. The auxiliary series admits an algebraic representation as the motivic generating series of a symmetric two-node quiver. We obtain explicit formulas for the coefficients, the exponential asymptotics of the number of paths of given area, and a linear recurrence whose coefficients are signed counts of partitions into distinct parts. For a random path of area nn we obtain a joint Gaussian limit law for the numbers of returns, horizontal steps and up steps. The height is of order log⁡n\sqrt{\log n}, and its distribution concentrates on two adjacent integers determined explicitly by nn.

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

math.PR — Probability

Curvature-Induced Killing at Stochastic Algebraic Folds

Contributed by Zhenyu Sun

We study the lifetime of a regular algebraic branch under continuous forcing and infinite-activity tangent jumps. For a parabolic fold, a first-order tangent kick decreases the discriminant by an exact quadratic amount. Symmetric stable marks of index α∈(0,2)\alpha\in(0,2) therefore generate a one-sided normal jump kernel of index q=α/2q=\alpha/2, with a coefficient determined by curvature. The normal diffusion and jump amplitudes depend on the evolving tangential state. We compute the full killed generator on powers of the discriminant and obtain occupation and terminal-jump bounds for this same joint process. Uniformly subcritical normal drift gives finite censored boundary lifetime and finite cumulative killing rate; continuous contact and jump exit both have positive probability. At and above the uniform critical threshold, a logarithmic nonlocal barrier excludes censored boundary contact, and the original branch terminates at a jump almost surely. A comparison after a stochastic time change yields an explicit stretched-exponential upper bound for survival and hence all positive lifetime moments. In the subcritical regime, an optimized upper bound for the probability of jump termination tends to zero as the curvature coefficient or the initial discriminant tends to zero. The analysis combines power estimates for the jump generator with a logarithmic barrier at the critical threshold. Numerical calculations illustrate the dependence of terminal causes on curvature.

A mix of human-written and AI-generated textHuman understanding: all partsLévy processesalgebraic foldsboundary accessibilitykilled jump diffusionsstochastic differential-algebraic equations
Oct 31, 202620 pages
PDFView work

math.PR — Probability

Smallest Gaps between Eigenvalues of Wigner Matrices without Smoothness Assumptions

Contributed by Patrick Lopatto

We determine the asymptotic distribution of the smallest gaps between eigenvalues in the bulk of the spectrum of real symmetric Wigner matrices, including Bernoulli matrices. After multiplication by N3/2N^{3/2}, the gaps and their locations converge to a Poisson point process with the same intensity as for the Gaussian orthogonal ensemble. Since changing a single entry can move eigenvalues by an amount comparable to the smallest gaps, standard perturbative comparison estimates do not directly resolve this scale for arbitrary entry distributions. Instead, we use that resampling a few random entries does not change the law of the matrix, and we show that the resampling moves each pair of nearby eigenvalues by a random walk that satisfies a local limit theorem; this requires excluding arithmetic structure in the eigenvectors. We also prove a law of large numbers for the number of gaps at all scales between N−3/2N^{-3/2} and N−1N^{-1}, and we sketch the proof of the analogous smallest-gap result for complex Hermitian Wigner matrices.

Primarily AI-generated textHuman understanding: some partsrandom matrix theory
Oct 31, 2026185 pages
PDFView work

math-ph — Mathematical Physics

First-order phase transition in Onsager's model of hard rods in R3\mathbb R^3

Contributed by Qidong He

We prove a first-order transition for hard rods in R3\mathbb R^3 whose orientations vary continuously over the sphere. For every sufficiently small positive ratio of diameter to length, the grand-canonical pressure has a nondifferentiable point, with a jump in number density at the intermediate Onsager scale. Following the phase-pressure strategy of Lebowitz, Mazel, and Presutti, we connect coexistence in the homogeneous Onsager functional to the microscopic pressure through an exact auxiliary-field representation, exponential decay of correlations in the rod gas at fixed auxiliary field, and estimates of the free-energy cost of interfaces between connected families of minimizing angular profiles.

Primarily AI-generated textHuman understanding: no parts
Oct 31, 202664 pages
PDFView work

math.PR — Probability

Infinite divisibility of hitting times for symmetric stable processes

Contributed by Min WANG

Let TaT_a be the first hitting time of a nonzero point aa by a symmetric strictly α\alpha-stable L\'evy process, where 1<α<21<\alpha<2. We give a computer-assisted classification of its ordinary additive infinite divisibility. There is a unique threshold α∗\alpha_*, with 1.6670659903<α∗<1.66706599151.6670659903<\alpha_*<1.6670659915, such that TaT_a is infinitely divisible if and only if 1<α≤α∗1<\alpha\le\alpha_*. The threshold is characterized by a unique zero contact of the canonical inverse logarithmic-derivative kernel. The proof combines explicit analytic estimates, rigorous interval covers, Gaussian necessary conditions and Rouch\'e's theorem. In particular, a fully analytic argument proves failure of infinite divisibility for every 15/8≤α<215/8\le\alpha<2. Scalar bounds at the two time ends reduce the compact interval computations. The finite computations and their acceptance conditions are supplied as ancillary material.

Primarily AI-generated textHuman understanding: no parts
Oct 29, 202627 pages
PDFView work

math.CA — Classical Analysis and ODEs

A Proof of McLeod's 1959 Conjecture on Complete Homogeneous Symmetric Ratios

Contributed by Suvrit Sra

We prove McLeod's (1959) conjecture that (hℓ+r/hℓ)1/r(h_{\ell+r}/h_\ell)^{1/r} is subadditive for all ℓ≥0\ell\ge0 and r≥1r\ge1, where hkh_k is the complete homogeneous symmetric polynomial of degree kk (J. B. McLeod, "On four inequalities in symmetric functions", Proc. Edinburgh Math. Soc., 1959). We first prove that the ratio hk/hk−1h_k/h_{k-1} is convex, and our proof takes an unexpected detour through queuing theory. The geometric mean of rr consecutive such ratios equals McLeod's conjectured function, but geometric means of convex functions need not be convex. Our second and decisive step is a tensorization trick that couples neighboring ratios tightly enough to make their geometric mean convex.

A mix of human-written and AI-generated textHuman understanding: all partsMcLeod inequalityclosed queuing networkcomplete homogeneous symmetric polynomialconvexitydiscrete Poincare inequality
Oct 29, 202611 pages
PDFView work

math.AP — Analysis of PDEs

From Döblin to Aleksandrov

Contributed by Amélie Loher, Connor Mooney, Clément Mouhot

We prove Aleksandrov maximum principles for linear second-order kinetic equations in non-divergence form with measurable, uniformly elliptic diffusion coefficients. For coefficients A(t,v)A(t,v) we obtain every source exponent p>2d+1p>2d+1. For autonomous coefficients a(x,v)a(x,v) in one space dimension, we obtain every p>p∗(Λλ)p>p_*(\frac\Lambda\lambda), where p∗(Λλ)<4p_*(\frac\Lambda\lambda)<4 depends only on the ellipticity ratio. The first step in both proofs is Döblin--Fourier cancellation: two positive parts of the kernel have nearly opposite phases, and a common lower bound for their velocity marginals allows us to cancel fixed portions of them. For the autonomous problem, this argument applies on velocity intervals away from zero. A preliminary Aleksandrov estimate gives Hölder continuity and then a Harnack comparison. A homogeneous Bellman barrier controls concentration in position and velocity; together with Harnack, it makes the local density estimates summable across zero velocity, including at p=4p=4. We give the full proofs and the passage from the maximum principle to local Hölder continuity.

Primarily AI-generated textHuman understanding: all parts
Oct 29, 202665 pages
PDFView work

math.PR — Probability

Dynamics of the spherical Sherrington–Kirkpatrick model, Part II: Mixing profiles and critical dynamics

Contributed by P. M. Aronow, Patrick Lopatto

We study the Langevin dynamics of the spherical Sherrington–Kirkpatrick model, the diffusion on the sphere of radius N\sqrt N in RN\mathbb R^N that is reversible with respect to the Gibbs measure with density proportional to exp⁡(βxTWx/2)\exp(\beta x^{\mathsf T}Wx/\sqrt2), where WW is an N×NN\times N matrix from the Gaussian orthogonal ensemble. The dynamics is started from the uniform distribution on the sphere, independently of WW. We determine the asymptotic quenched total-variation distance to equilibrium as a function of time in the fixed-temperature, mesoscopic, critical-window, and infinite-temperature crossover regimes described below, with convergence in probability or in distribution with respect to WW. Let βc=1/2\beta_c=1/\sqrt2 be the critical inverse temperature. For β<βc\beta<\beta_c there is cutoff with a Gaussian profile at fixed β∈(0,βc)\beta\in(0,\beta_c), along every mesoscopic approach of β\beta to βc\beta_c from below, and in the infinite-temperature crossover when NβN2→∞N\beta_N^2\to\infty; when NβN2N\beta_N^2 stays bounded, the distance relaxes over bounded times and there is no cutoff. At fixed β∈(0,βc)\beta\in(0,\beta_c) the mixing time is (log⁡N−(3/2)log⁡log⁡N+O(1))/(4(1−2β)2)(\log N-(3/2)\log\log N+O(1))/(4(1-\sqrt2\beta)^2), and the correction −(3/2)log⁡log⁡N-(3/2)\log\log N comes from the edge of the spectrum of WW. For β>βc\beta>\beta_c, at fixed β\beta and along every mesoscopic approach to βc\beta_c from above, there is cutoff at a time set by the gap between the two largest eigenvalues of WW, of order N2/3log⁡NN^{2/3}\log N at fixed β\beta. The profile is the total-variation distance between a standard Gaussian variable and its sum with an independent Cauchy variable; the Cauchy variable is the ratio of the first two eigencoordinates at an early stage of the evolution. In the critical window 2β=1+σN−1/3\sqrt2\beta=1+\sigma N^{-1/3}, the distance at time N2/3sN^{2/3}s converges in distribution to a random profile determined by the Airy point process, and there is no cutoff. As σ→±∞\sigma\to\pm\infty, this profile, suitably recentered and rescaled, converges to the profiles of the two mesoscopic regimes.

Primarily AI-generated textHuman understanding: some partsdynamicsspin glass
Oct 29, 2026269 pages
PDFView work