A field on ReadSearch
Mathematics & Statistics
New mathematics and statistics is posted on arXiv, often long before it appears in a journal. This page shows the newest papers ReadSearch has read, from algebra and geometry to analysis, probability and applied mathematics.
The newest 1,000 papers, from 13 October 2026 to 5 November 2026: 971 arXiv preprints and 29 OpenAlex records.
Newest papers, page 4
Can a self-sustaining chemical network emerge due to just a few catalysts?
Understanding how self-sustaining chemical reaction networks can emerge from simple molecules is an important question in chemical approaches to the origin of life.Exponential Seniority Weighting Chain-Ladder Reserving
We develop a tractable state-space version of the chain-ladder model.CARM: Conformal Adaptive Risk Masking for Reliable Scientific Super-Resolution
Deep learning-based super-resolution (SR) can reconstruct fine-scale Earth-observation fields from coarse observations, but reconstruction accuracy alone does not provide a calibrated rule for…A Polynomial Erdős-Pósa bound for Eulerian digraphs
In [Combinatorica 1996], Reed, Robertson, Seymour and Thomas proved Younger's conjecture dating back to 1973 that states that directed cycles have the Erdős-Pósa property.An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine
The halting problem asks whether a program eventually halts, with unrestricted resources.Discrete Backbone Elasticity and Curvature-Dependent Torsion Statistics in Proteins
Coarse-grained models of protein conformational dynamics use $\mathrm{C}_α$ geometry to describe the probabilities of regular helices, ordered turns and disordered conformations.From hydrological laws to catchment models: A process-based model matches deep-learning accuracy on three continents
Dooge asked whether hydrology has laws at the catchment scale.Beyond the Gap: What Imaginary-Time Evolution Reveals About the Edge of the Continuum
The spectral gap, the energy separating the ground state from the first excitation, governs many quantum phenomena, yet it is far harder to compute than the ground state.A general technique for explicit quantile representations
This work proves existence of contours independent of probability level for exact quantile integrals of strictly positive real-analytic densities.How many sorted projections determine n points in k dimensions?
Let $d_1,\dots,d_m$ be directions in $\mathbb{R}^k$, where $k\ge 2$.A $2.81^n$ upper bound on the number of stable matchings
We study the maximum number ${\rm SM}(n)$ of stable matchings in an instance with $n$ men and $n$ women.Constrained defined-contribution pension management: A reparameterized neural network approach
This paper studies constrained defined contribution (DC) pension management under a two-factor financial market model.A Variational Quantum Algorithm for Multi-Skill Project Scheduling
Job scheduling is an NP-hard optimization problem with clear industrial relevance.An Interaction-Aware Decision Framework for FDIC-Assisted Distressed Bank Acquisitions: Empirical Evidence from the FDIC Failed-Bank Panel and the SVB-First Citizens Case
Acquirers of failed banks weigh acquisition value, regulatory protection, risk, buyer strength, and execution difficulty jointly, because each signal's meaning depends on the others: high…Stability of energy gap of macroscopic quantum matter
In quantum many-body physics and quantum field theory, it is often assumed that gapped systems remain gapped under sufficiently weak local perturbations.A Tensor-Network Chebyshev-Galerkin Method for Boundary-Value Problems in Computational Mechanics
Quantum-inspired numerical methods for partial differential equations represent discretized fields and operators as quantics tensor trains (QTT), so that their cost depends on how compressible the…Spectral properties of twisted soft waveguides
We discuss a model of a soft waveguide described by Schrödinger operator whose potential is a twisted straight channel of non-circular profile.A Sub-$3^n$ Upper Bound on the Number of Stable Matchings
We study the problem of determining the maximum number of stable matchings.A Counterexample to the Weak Gibbs and Regularity Conjectures
We provide a counterexample to the weak Gibbs and regularity conjectures.Polynomial-Time Differentially Private Synthetic Graph Release with Nearly-Linear Additive Error
We give a polynomial-time $(\varepsilon, δ)$-edge-differentially private algorithm that releases a synthetic graph approximately preserving all cut values of a nonnegative weighted input graph $G$.
Get the few papers worth your time in Mathematics & Statistics every morning.
Choose your topics and ReadSearch reads the new papers in them each day, then brings you the few worth reading, each with its key finding in a sentence.