Analysis & PDE · Mathematics & Statistics
Functional Analysis
The newest papers in Functional Analysis that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
39 papers, from 7 September 2026 to 30 October 2026: 39 arXiv preprints.
Get the few papers worth your time in Functional Analysis every morning.
Follow Functional Analysis and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 2
The Silhouette Operator: Identifiability of Low-Rank Measures from One-Dimensional Projections
Structured recovery phenomena, such as restricted isometry properties in compressed sensing, have shown that high-dimensional objects can often be reconstructed from remarkably low-dimensional…An Explicit Counterexample to Tsirelson's Problem via a Linear System Game
We construct an explicit binary linear system game that separates $C_{qa}$, the closure of the set of finite dimensional quantum correlations, from $C_{qc}$, the set of commuting operator…Ballistic Speed and Potential-Theoretic Recurrence for Homogeneous Open Quantum Random Walks
Our study connects root-mean-square ballistic transport to potential-theoretic recurrence for finite-range open quantum random walks.Quantum Markov State Models for Metastable Dynamics
Open quantum systems can rapidly lose most microscopic information, leaving only a few degrees of freedom to govern their long-time dynamics.Stability of isometries of quantum states
We prove dimension-independent Hyers-Ulam stability for surjective approximate isometries of the positive trace-class cone in both the trace and Bures metrics.Deep kernel hedging
We introduce a deep kernel hedging framework that combines the flexibility of deep learning with the structural inductive bias of kernel methods.Transversal Pooling Neural Networks
Many learning tasks require stability to small transformations while retaining sensitivity to larger ones.A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
We prove nearly quadratic lower bounds for randomized algorithms for linear optimization and uniform sampling over convex bodies in the membership oracle model.The Failure of Simultaneous Quantum Typicality
We establish exact thresholds for the failure of simultaneous quantum typicality: three parties for mixed states and four for pure states.A complete characterization of eventually entanglement breaking unital quantum channels
We obtain a complete characterization of eventually entanglement breaking (EEB) unital channels in terms of some simple commutation properties of their eigenvectors.Sharper Bounds for the Complex Grothendieck Constant
We show that $1.4<K_G^{\mathbb{C}}<1.404898554746$, where $K_G^{\mathbb{C}}$ is the complex Grothendieck constant.Kadison--Singer partitions and Bilu--Linial graph signings in polynomial time
We prove two main algorithmic results in spectral discrepancy.Toscani-Fourier Distance on Probability Measures: Wasserstein Control, Topological Equivalence on Model Classes, and Duality
Comparing probability measures in machine learning trades transport geometry against computational cost: Wasserstein distances encode the geometry of $\mathbb R^d$ but require solving a transport…A Walk From Free Probability to Matrix Discrepancy II: Weaver's Problem and the Kadison-Singer Conjecture
\cite{mss2015} proved Weaver's discrepancy result existentially, resolving the Kadison--Singer conjecture .Rank-One Matrix Discrepancy and Algorithmic Kadison--Singer
We give a deterministic polynomial-time algorithm that, given rational Hermitian matrices $H_1,\dots,H_N$ of rank at most one, finds signs $s\in\{\pm1\}^N$ with $\|\sum_i s_i H_i\|\le 13\|\sum_i…Matrix Spencer: Eight Standard Deviations Suffice and an Almost-Linear Time Algorithm for Dense Input
The Matrix Spencer conjecture asserts that for all symmetric matrices $A_1,\ldots,A_n\in\mathbb{R}^{n\times n}$ with $\|A_i\|\le1$ there are signs $\varepsilon_1,\ldots,\varepsilon_n\in\{-1,1\}$…Resolution-Independent Analysis of Encoder--Decoder Operator Learning via Limiting Kernels
Operator learning is formulated on function spaces, but training data are typically available only through finite-dimensional representations.Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification
We construct counterexamples to Rockafellar's sum conjecture in which two maximally monotone operators satisfy the interior-domain condition but their sum is not maximally monotone.Kolmogorov--Arnold stability for discontinuous functions
Here we investigate the stability of the Kolmogorov--Arnold representation theorem (KART) under adversarial reparameterisations of the hidden layer for multivariate discontinuous and unbounded…