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 23
Meshless Latent Dynamics Models for Model Order Reduction of time-dependent Partial Differential Equations
Latent dynamics learning has emerged as a prominent approach for Model Order Reduction (MOR) of time-dependent, parameterized Partial Differential Equations (PDEs).Nonlinear Maps Between Irreducible Representations in Graph Neural Networks
Equivariant linear maps cannot mix non-isomorphic irreducible representations, whereas nonlinear activations can.Stochastic and Noisy Oracles in Smooth Continuous Optimization
We review models of inexact computational oracles in smooth continuous optimization and their implications for the convergence, computational complexity, and attainable accuracy of optimization…The information geometry of the Sinkhorn divergence on a Hilbert manifold
The Sinkhorn divergence, the debiased entropic optimal transport cost, determines a metric tensor on probability measures defined along curves, due to Lavenant et al. We construct a real-analytic…Computer-Assisted Results for \(n\)-Sided Non-Transitive Dice Taking Face Values in \([n]\)
We consider non-transitivity among dice with \(n\) sides restricted to taking face values in the set \(\{1,\ldots,n\}\).Minimum-Time Escape from the Conic Field of View of a Reeds--Shepp Pursuer: the Faster Evader
We continue the study of minimum-time escape of an omnidirectional evader from the forward conic field of view of a Reeds--Shepp pursuer, now for a faster evader, and solve the game for every speed…DecompGym: Benchmarking LLM Agents on Designing Decomposition Algorithms
Benders decomposition and column generation solve large optimization problems by passing cuts, columns, and dual values between a master problem and subproblems, and are hard to implement correctly.In-Context Learning for Multi-Fidelity Multiscale Model Closure and Cross-Operator Out-Of-Distribution Generalization
Multi-fidelity learning uses low-fidelity information (coarse-scale PDE models) together with limited high-fidelity data (fine-scale solutions) to obtain high-accuracy PDE solutions.Convex-SKM-Net: Low-Latency Block Halfspace Corrections for Neural Convex Constraint Satisfaction
Fast inference and strict constraint satisfaction are essential for learning-based decision-making.Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part II: Langevin Dynamics
We consider the tensor principal components analysis (tensor PCA) problem on the sphere, in which we are asked to recover an unknown vector in $\mathcal{S}_N=\{x\in\mathbb{R}^N:\lVert x\rVert^2=N\}$…Scalable Bayesian Quadrature via Operator-Adapted Features
Kernel methods face two recurrent bottlenecks: the cubic cost of inverting an $n\times n$ kernel matrix, as in kernel ridge regression, and the evaluation of kernel integrals, as required in kernel…FACTS-MAS: A Multi-Agent Architecture for Adaptive Forecasting from Heterogeneous Evidence
Real-world forecasting often requires integrating heterogeneous evidence whose predictive value varies across horizons, operating regimes, and domains.A Hybrid Physics-informed holomorphic neural networks Method
Physics-informed holomorphic neural networks (PIHNNs) exploit complex-analytic representations to satisfy homogeneous PDEs by construction, but their extension to nonhomogeneous problems is…Game-Theoretic Foundations for Undiscounted Bisimulation Metrics
Bisimulation metrics offer a principled notion of task-relevant state similarity in reinforcement learning, but existing constructions and methods are largely confined to discounted MDPs, where…Einstein Metrics and Quantum Control on Symmetric Tensor Product Quotients
Let $M_n=(\mathrm{PU}(2)^n\rtimes S_n)\backslash\mathrm{PU}(2^n)$ be the space of projective $n$-qubit unitaries modulo local unitaries and permutations of the qubits.Robustness of Magic and the Directed Geometry of State Conversion
In this work, we introduce a state-space distance calibrated by stabilizer states based on the dual structure of the robustness of magic (RoM), and show that RoM is exactly represented as the…Controllability-Based Input Allocation in Quantum System
Understanding how local perturbations influence global quantum dynamics is important for analyzing and designing large-scale quantum systems.Capacity of the Hopfield-Hebbian dynamics with correlated patterns
Allowing for small fraction of errors in retrieved stored binary patterns, Hopfield-Hebbian neural network (NN) associative memory dynamics [14] achieves linearly scaled capacity.Calibration of Passive Market Impact with a Queue-Sensitive Propagator Model
We develop a framework for calibrating passive market impact, defined as the price response to liquidity-providing limit orders, in contrast to the impact of liquidity-consuming market orders.Accelerating Nonlinear MPC by Behavior Cloning with Separated Timescales: Application to Nuclear Reactor Load-Following
Behavior Cloning (BC) of expert controllers for multiscale dynamical systems is challenging: state variables evolving at widely separated timescales induce highly nonlinear couplings that a shared…
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.