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 2
Randomized and Oracle-Based Feasible Directions Methods for Nonsmooth Nonconvex Constrained Optimization
Minimizing nonsmooth nonconvex objectives over general convex sets using no derivatives of the objective, together with structural access to the constraint set, poses a fundamental geometric…Discrete quadrature spectrum of composite bosons: Weyl relation, intensity correlations, and binned homodyne detection
A composite boson made of two fermions can look elementary under one measurement and composite under another.Newton Steps are Faster for Linear Complementarity Problems
Linear Complementarity Problems (LCPs) with sufficient matrices form a well-studied class of problems, dating back from the foundational works of Cottle and Dantzig (1968).Continuous Space-Time Finite Element Simulations for Biomedical Flows with Large Boundary Motion and Time-Periodicity
We present an axisymmetric continuous simplex space-time finite element method for incompressible fluid flow.XM4D: 4D Reconstruction through Certifiable Geometric Optimization
Accurate 4D reconstruction remains challenging: jointly estimating camera motion, scene geometry, and non-rigid deformation entails highly nonconvex optimization, making global optimality difficult…Joint Modeling of Conditional Mean and Variability in Multilevel Functional Data: Application to Postprandial Glucose Trajectories in the AEGIS Study
Functional data analysis provides a framework for studying time-varying associations between covariates and high-frequency biological signals.Reversible Dynamics, Asymmetric Actions: Parking as a Trajectory-Level Affordance
Drivers are often told to back into a tight parking space, not drive in nose first.Quantifying the remaining search space in analogue optimisation
Benchmarking analogue optimisers requires certifying not only how close a returned energy is to the optimum, but also how many better configurations may remain.Exponential mixing time for the Davies dynamics of the quantum random energy model
We prove exponentially slow thermalization for the quantum random energy model (QREM) under Davies dynamics.Doubly-robust causal inference for multi-valued treatment regimes with recurrent neural networks
We propose a doubly-robust method to estimate the causal effects of multi-valued treatment regimes on patient outcomes.Between Hi-Fi and MMI: the overlap of redundancy and synergy in partial information decomposition
Partial information decomposition (PID) splits the information that two sources carry about a target into redundant, unique and synergistic parts, with nonnegative decompositions lying on a segment…First-Order Model Checking on Monadically Dependent Graph Classes
Monadically dependent graph classes are those in which first-order logic cannot encode all graphs.Uniform Three-Fold Product Expansion of Algebraic-Geometry Codes over a Fixed Field
A collection of classical codes $C_1,\dots,C_m$ has product expansion if every low-weight word in the sum of their extensions to the product space can be written as a sum of words supported on few…Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes
We determine the maximum number of common zeros in projective space of any set of linearly independent homogeneous polynomials of the same degree, when the degree is smaller than the cardinality of…The probabilistic bound for perfect hashing is sharp only for binary alphabets
We investigate the optimal asymptotic rate $R_q$ of perfect $q$-hash codes, a fundamental extremal problem in combinatorics, information theory, and computer science.All minimum cuts of symmetric submodular functions
We compute Cunningham's canonical decomposition of a symmetric submodular function on $n$ elements in $O(n^3)$ time.Dualities in one-dimensional quantum lattice models: Lie groups, Schur-Weyl duality and symmetry breaking
We present a systematic framework for gauging continuous symmetries, and show that the Schur-Weyl duality arises naturally as a realization of this construction with open boundary conditions.Dynamic Optimistic Constrained OCO with Memory via Delay Equivalence
Online Convex Optimization with memory and time-varying constraints (COCO-M) is a recently-introduced framework that captures the dynamics of stateful online learning and non-stochastic control with…Asymptotic analysis of the dynamical field-field correlation function of the impenetrable Bose gas
We study the long-time, large-distance asymptotic behaviour of the two-point correlation function of fields of the impenetrable Bose gas in equilibrium states characterized by a quasi-momentum…A Theoretical Analysis of a Bilevel Optimization Formulation for Combined Local-Global Optical Flow Models
This paper analyzes a bilevel formulation for learning the regularization parameter of combined local-global (CLG) optical flow models.
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.