Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 7 April

Functional Analysis

Propagation Phenomena for Operator-Valued Weighted Shifts

This paper is devoted to the study of propagation phenomena for $2$–hyponormal, quadratically hyponormal, and cubically hyponormal operator-valued weighted shifts. \ First, we show that every quadratically hyponormal matrix-valued weighted shift with two equal weights (excluding the initial weight) is flat. \ Second, we show that a cubically hyponormal operator-valued weighted shift with two equal weights (possibly including the initial weight) is flat. \ Next, we introduce a local flatness notion for matrix-valued weighted shifts. \ We prove that $2$–hyponormal (in particular, subnormal) matrix-valued weighted shifts satisfy this stronger propagation phenomenon. \ As a result, we prove a structural decomposition theorem for $2$–hyponormal matrix-valued weighted shifts.
Read the full abstract

All authors Raul E. Curto, Abderrazzak Ech-charyfy, Hamza El Azhar, El Hassan Zerouali

Algebraic Geometry

Structure of the Anticanonical Minimal Model Program for Potentially klt Pairs

We give an alternative proof of the existence of the anticanonical minimal model program for potentially klt pairs, assuming the anticanonical divisor admits a birational Zariski decomposition. Moreover, we establish a structure theorem showing that any partial anticanonical MMP starting from a potentially klt pair can be lifted to a compatible sequence of nonpositive maps between the $\mathbb{Q}$-factorial terminalizations of its successive steps.
Read the full abstract

General Mathematics

Mixed Hodge Modules and Canonical Perverse Extensions for Multi-Node Conifold Degenerations

We study one-parameter conifold degenerations whose central fiber \(X_0\) has finitely many ordinary double points and construct a mixed-Hodge-module refinement of the corrected perverse variation-cone object associated with the degeneration. At each node \(p_k\), the local \(\can^H/\Var^H/N\) geometry determines a rank-one point-supported interface block \(W_k^H\simeq i_{k*}\Q^H_{\{p_k\}}(-1)\). These blocks assemble canonically into \(Q_\Sigma^H=\bigoplus_{k=1}^r W_k^H\), through which the node-supported monodromy factors. We prove that the perverse-normalized cone \(\Cone(\Var^H)\) is concentrated in the mixed-Hodge-module heart, thereby defining \(\mathcal P^H\in MHM(X_0)\), and that \(\rat(\mathcal P^H)\simeq\mathcal P\). In the forward Yoneda orientation, the point-supported quotient is instead \(R_\Sigma^H\simeq\bigoplus_{k=1}^r i_{k*}\Q^H_{\{p_k\}}(-2)\), exhibiting a Hodge-theoretic distinction invisible after rational realization. We further prove a canonical nodewise decomposition of the rational perverse extension space and construct a morphism from the formal local Hodge sector to the independently defined limiting mixed Hodge structure. Its image records the node contributions that survive in global limiting cohomology, allowing nontrivial global relations among vanishing cycles.
Read the full abstract

2604.05367 · 7 Apr · Strengthened the local and global mixed-Hodge-module constructions, clarified Tate normalization and Yoneda orientations, expanded the nodewise Ext and LMHS comparisons, added technical appendices, and revised the exposition, citations, notation, and figures throughout

Numerical Analysis

Mathematical analysis and symmetric fractional-order reduction method for diffusion-wave equations

In this work, our aim is to introduce a symmetric fractional-order reduction (SFOR) method to develop numerical algorithms on nonuniform temporal meshes for fractional wave equations under lower regularity assumptions. The $L$-type methods–including $L1$ and $L2$-$1_\sigma$ schemes–are specifically designed for diffusion-wave equations, and we propose novel optimal parameter selections tailored to nonuniform meshes. Finally, several numerical experiments are conducted to validate the efficiency and accuracy of the algorithms.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Boundary Rényi oscillations in the open XX chain

For the ground state of the semi-infinite XX chain with Fermi momentum $k_F$, we derive the extracted $2k_F$ contribution to the Rényi entropy of its first $\ell$ sites at fixed $\alpha>1$. Its phase $\sin[(2\ell+1)k_F]$ matches the Friedel oscillation at the entangling bond and becomes the even–odd alternation at half filling. An exact Hankel determinant reduction and Riemann–Hilbert analysis give every term $\mathcal{L}^{-(2q-1)/\alpha}$ for positive integers $q$ with $2q-1<\alpha$, where $\mathcal{L}=4\ell\sin k_F$, with an $O(\mathcal{L}^{-1})$ error within this extracted component for $k_F$ away from $0$ and $\pi$. At integer $\alpha=p\ge2$, exact factorization gives a finite sum over all roots with error $O(\mathcal{L}^{-1-1/p})$. We also determine the $2k_F$ terms of $\log Z_\alpha(\phi)$, where $Z_\alpha(\phi)=\operatorname{Tr}(\rho_A^\alpha e^{i\phi Q_A})$, $\rho_A$ is the block's reduced density matrix, and $Q_A$ is its fermion number. At fixed nonzero flux $|\phi|<\pi$ with $2q-1\mp\phi/\pi\ne\alpha$, the two exponential terms have different decay powers. Exact factorization sharpens the integer result. These pointwise estimates do not justify projection to fixed charge. The uncharged sequence and the two leading charged terms agree with earlier generalized Fisher–Hartwig predictions. Numerical calculations at $p=4$ test the predicted subleading coefficients without an adjustable normalization.
Read the full abstract

Information Theory

Generative Channel Knowledge Base With Environmental Information for Joint Source-Channel Coding in Semantic Communications

Semantic knowledge bases are regarded as a promising technology for upcoming 6G communications. However, existing studies mainly focus on source-side semantic modeling while overlooking the structural impact of propagation environments on semantic transmission performance. To address this issue, we propose a generative channel knowledge base (CKB) with environmental information to facilitate joint source-channel coding (JSCC) in semantic communications (SemCom) systems. First, to enable the construction of the CKB, an environment-aware dataset is established by collecting spatial position information, global image features, fine-grained semantic features, and the corresponding channel matrices. A region-of-interest (ROI)-based filtering algorithm is further designed to remove semantic components that are irrelevant to signal propagation. Second, a Transformer-based generative framework is developed to learn the mapping between multidimensional environmental information and channel matrices. A self-attention mechanism is introduced to adaptively fuse heterogeneous features, enabling the construction of a structured CKB. Third, a CKB-driven JSCC SemCom architecture is proposed, where the generated channel knowledge is injected into both of the encoder and decoder to jointly exploit source semantics and channel-environment priors in an end-to-end manner. Experimental results demonstrate that the proposed multidimensional feature fusion method achieves a channel matrix estimation error at the $10^{-3}$ level. Moreover, the CKB-driven JSCC SemCom framework integrated into SemCom systems significantly outperforms existing benchmark schemes in terms of transmission performance.
Read the full abstract

All authors Xudong Long, Hao Chen, Dan Wang, Chen Qiu, Nan Ma, Xiaodong Xu, Yubin Zhao

Analysis of PDEs

Global existence of weak solutions for Landau-Lifshitz equation with helical derivatives

In this paper, we investigate the chiral boundary value problem for the Landau-Lifshitz equation with helical derivatives. By introducing Sobolev spaces adapted to the helical derivative and establishing energy estimates that are compatible with the chiral boundary condition, we prove the global existence of weak solutions to this problem, both in the presence and in the absence of damping terms.
Read the full abstract

Logic

Structural Hierarchy of Reid Class of non-Archimedean Banach Spaces

Let $k$ be a complete valuation field. We formulate a class $\mathscr{R}$ of Banach $k$-vector spaces analogous to Reid class of Abelian groups. We formulate an analogue of the hierarchy of Reid class introduced by K.\ Eda, and verify a counterpart of the classification theorem of Reid class by K.\ Eda. As an application, we verify that the Banach $\mathbb{C}_p$-vector spaces \begin{eqnarray*} & & \ell^{\infty}(\mathbb{N},\mathbb{C}_p), \textC_0(\mathbb{N},\mathbb{C}_p), \ell^{\infty}(\mathbb{N},\textC_0(\mathbb{N},\mathbb{C}_p)), \textC_0(\mathbb{N},\ell^{\infty}(\mathbb{N},\mathbb{C}_p)), \\ & & \ell^{\infty}(\mathbb{N},\textC_0(\mathbb{N},\ell^{\infty}(\mathbb{N},\mathbb{C}_p))), \textC_0(\mathbb{N},\ell^{\infty}(\mathbb{N},\textC_0(\mathbb{N},\mathbb{C}_p))), \end{eqnarray*} and so on are all distinct, the Banach $\mathbb{C}_p$-vector space of bounded continuous functions $\mathbb{Q} \to \mathbb{C}_p$ and its dual Banach $\mathbb{C}_p$-vector spaces cannot be expressed by iterated application of bounded direct product and completed direct sum, and there is no left adjoint functor of the forgetful functor from $\mathscr{R}$ to the category of Banach $\mathbb{C}_p$-vector spaces.
Read the full abstract

Information Theory · Cross-listed from cs.LG

A Theoretical Framework for Statistical Evaluability of Generative Models

Statistical evaluation aims to estimate the generalization performance of a model using held-out i.i.d. test data sampled from the ground-truth distribution. In supervised learning settings such as classification, performance metrics such as error rate are well-defined, and test error reliably approximates population error given sufficiently large datasets. In contrast, evaluation is more challenging for generative models due to their open-ended nature: it is unclear which metrics are appropriate and whether such metrics can be reliably evaluated from finite samples. In this work, we introduce a theoretical framework for evaluating generative models and establish evaluability results for commonly used metrics. We study two categories of metrics: test-based metrics, including integral probability metrics (IPMs), and Rényi divergences. We show that IPMs with respect to any bounded test class can be evaluated from finite samples up to multiplicative and additive approximation errors. Moreover, when the test class has finite fat-shattering dimension, IPMs can be evaluated with arbitrary precision. In contrast, Rényi and KL divergences are not evaluable from finite samples, as their values can be critically determined by rare events. We also analyze the potential and limitations of perplexity as an evaluation method.
Read the full abstract

All authors Shashaank Aiyer, Yishay Mansour, Shay Moran, Han Shao

Numerical Analysis

Higher-Order Multiscale Computational Method for Multi-Continuum Problems in Highly Heterogeneous Media

This paper presents a high-accuracy higher-order multiscale method for solving multi-continuum problems in in highly heterogeneous media. First, microscopic unit cell functions are defined, leading to the derivation of macroscopic homogenized equations and formulas for calculating effective parameters, which yield a higher-order multi-scale (HOMS) asymptotic solution. Subsequently, the pointwise approximation properties of this solution to the original equations are analyzed, and its convergence rate in the integral norm is rigorously established under certain assumptions. Furthermore, a multiscale numerical algorithm is developed by integrating the finite element method (FEM), finite difference method, and interpolation technique. Finally, numerical experiments demonstrate the high accuracy, efficiency, and stability of the proposed HOMS numerical algorithm.
Read the full abstract

Number Theory

Matchable numbers

We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has an asymptotic density, which we compute, and we show that every squarefree number is matchable. We also present some related unsolved problems.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Jeffreys Flow: Robust Boltzmann Generators for Rare Event Sampling via Parallel Tempering Distillation

Sampling physical systems with rough energy landscapes is hindered by rare events and metastable trapping. While Boltzmann generators already offer a solution, their reliance on the reverse Kullback–Leibler divergence frequently induces catastrophic mode collapse, missing specific modes in multi-modal distributions. Here, we introduce the Jeffreys Flow, a robust generative framework that mitigates this failure by distilling empirical sampling data from Parallel Tempering trajectories using the symmetric Jeffreys divergence. This formulation effectively balances local target-seeking precision with global modes coverage. We show that minimizing Jeffreys divergence suppresses mode collapse and structurally corrects inherent inaccuracies via distillation of the empirical reference data. We demonstrate the framework's scalability and accuracy on highly non-convex multidimensional benchmarks, including the systematic correction of stochastic gradient biases in Replica Exchange Stochastic Gradient Langevin Dynamics and the massive acceleration of exact importance sampling in Path Integral Monte Carlo for quantum thermal states.
Read the full abstract

All authors Guang Lin, Christian Moya, Di Qi, Xuda Ye

Mathematical Physics

Constructive Quantum Field Theory and Rigorous Statistical Mechanics via Operator Algebras and Probability Theory – Guiding Principles and Research Perspectives

We present a hierarchical viewpoint on the operator-algebraic formulation of quantum systems, in which $C^{*}$-algebras are responsible for the universal and intrinsic description, whereas von Neumann algebras provide the detailed account obtained after fixing a state compatible with the dynamics. From this standpoint, for bosonic many-body systems the resolvent algebra, rather than the Weyl algebra, is the natural object; in particular, its nuclearity, trivial center, and rich ideal structure faithfully reflect purely quantum-mechanical structures. Macroscopic variables or sector structures associated with phase transitions are captured as the center appearing in the weak closure of the GNS representation. Moreover, the equivalence between representations of operator algebras and functional integrals allows powerful probabilistic methods to be employed. Taking these as guiding principles, we outline research perspectives on concrete objects in constructive quantum field theory and rigorous statistical mechanics.
Read the full abstract

Numerical Analysis

Multi-Scale Kinetic Simulation: Asymptotic Preserving IMEX-BDF-DG Schemes with Three Implicit-Explicit Partitionings

Kinetic transport models are mesoscopic mathematical descriptions of the transport of particles as well as their interactions with the background media or among themselves, and they have wide applications in many areas of mathematical physics such as nuclear and biomedical engineering, rarefied gas dynamics, and plasma physics. They are often multi-scale, with different characteristics (e.g. hyperbolic, diffusive) depending on the material properties. As our continuing effort to design and analyze numerical methods for accurate and robust simulation of the multi-scale kinetic transport models, in this work, we consider a linear kinetic transport model, a simplified radiative transfer equation, in a diffusive scaling, and propose and analyze three families of asymptotic preserving (AP) methods. Numerical methods with the AP property, that is to preserve the asymptotic behavior of the models at the discrete level on under-resolved meshes, can work uniformly well to simulate multi-scale models across a wide range of scales. The proposed methods start from the micro-macro decomposition of the model, and involve discontinuous Galerkin (DG) methods in space, the discrete ordinates method (i.e. $S_N$ method) in velocity, and implicit-explicit (IMEX) BDF methods in time, with three different IMEX partitionings. A systematic study, both analytically and computationally, is presented regarding their difference in stability, accuracy, computational complexity and AP property. These methods, with multi-step time integrators, are also compared in terms of their accuracy and efficiency with the ones that only differ in using certain IMEX Runge-Kutta methods in time. Together with our previous developments, the present work further contributes to high order DG AP methods for multi-scale kinetic simulation, especially by utilizing the structure of the micro-macro decomposition of the models.
Read the full abstract

Optimization and Control

Mean Field Games and Control on Large Expander Graphs

This paper investigates mean field games on sparse networks. In the case of large expander graphs, the limit topologies are analyzed using the graphexon framework, which characterizes sparse connections. We prove that the associated sequence of discrete averaging operators converges strongly to a continuous operator and this is illustrated in the development of infinite limits of Gabber-Galil-Margulis expander graphs \cite{gabber1981explicit}. These properties enable the formulation and existence proof of equilibria for linear-quadratic mean field games in which each agent is identified by a spatial network label $\alpha \in X$ and only interacts with the neighborhood average characterized by the operator $\mathcal{G}$, i.e., the average state of a limited number of connected neighbors in a large expander graph. Furthermore, algebraic conditions induced by the spectral gap of $\mathcal{G}$ for the global asymptotic stability of the closed-loop system are established, and parameter thresholds that give rise to a Turing-type topological instability are established.
Read the full abstract

Algebraic Geometry

Geometric singularities of regular surfaces with nef anti-canonical divisors over imperfect fields

Let $S$ be a regular projective surface over a field $k$ of characteristic $p>0$, with $H^0(S,\mathcal{O}_S)=k$ and $-K_S$ nef. We prove that $S$ is geometrically integral over $k$ when $p\geq 7$, and we also find an example of $S$ that is not geometrically integral when $p=5$.

Combinatorics

Induced rational exponents near two

Given a bipartite graph $H$ and a natural number $s$, let $\mathrm{ex}^*(n,H,s)$ denote the maximum number of edges in an $n$-vertex graph that contains neither $K_{s,s}$ nor an induced copy of $H$. Hunter, Milojević, Sudakov, and Tomon conjectured that $\mathrm{ex}^*(n,H,s)=O_{H,s}(\mathrm{ex}(n,H))$ whenever $H$ is connected. Motivated by this conjecture and the rational exponents conjecture, Dong, Gao, Li, and Liu conjectured that for every rational $r\in (1,2)$ there is a bipartite graph $H$ and an $s_0$ such that $\mathrm{ex}^*(n,H,s)=\Theta(n^r)$ for all $s\geq s_0$. We prove that the latter conjecture holds for all rationals $r=2-a/b$, where $a,b\in\mathbb{N}$ satisfy $b\geq \max\{a,(a-1)^2\}$. Our result extends a well-known result of Conlon and Janzer to the induced setting and adds more evidence to support the former conjecture.
Read the full abstract

Number Theory

A statistical investigation of a divisor-sum function

The sum of proper divisors function $s(n)$ has been studied for more than 2000 years. In this paper we study statistical properties of the related function $S_s(n) \coloneqq \sum_{d \mid n} s(d)$. This function arises from a generalization of the practical numbers. Although $S_s(n)$ is neither additive nor multiplicative, we prove that $S_s(n)/n$ has a continuous asymptotic distribution function, and that its values are dense in the interval $[0,\infty)$. We evaluate its mean and establish the existence of all higher moments. Moreover, if $\mu_k$ denotes the $k^{th}$ moment of $S_s(n)/n$, we show that $$\mu_k^{1/k} \sim e^{2\gamma} (\log k)^2$$ as $k \rightarrow \infty$, where $\gamma$ is the Euler-Mascheroni constant.
Read the full abstract

Group Theory

Permutational wreath pullbacks and framed braid-type groups

Let $\sigma\colon G \to S_n$ be a surjective homomorphism and let $H$ be a group. We introduce the permutational wreath pullback \[ H \wr_\sigma G = H^n \rtimes_\sigma G, \] where the action of $G$ on $H^n$ is induced by permutation of coordinates via $\sigma$, and undertake a systematic structural study of this construction. We determine the center and the abelianization in full generality. We further show that $H \wr_\sigma G$ admits a natural interpretation as the pullback of the classical wreath product $H \wr S_n$ along $\sigma$, providing a conceptual explanation for its functorial behavior. When $H$ is finitely generated abelian, we establish a criterion for the abelian kernel $H^n$ to be characteristic and for $H \wr_\sigma G$ to inherit the $R_\infty$-property from $G$; we verify this criterion for kernels arising from the virtual braid group $VB_n$ and the virtual twin group $VT_n$, obtaining new families of framed groups with the $R_\infty$-property. Rigidity results show that the abelian kernel, $n$, $H$, and $G$ are determined by the abstract group $H \wr_\sigma G$. Applications include uniform descriptions of classical, surface, virtual, and singular framed braid groups, and a reduction of splitting problems for framed surface braid groups to the classical Fadell–Neuwirth setting.
Read the full abstract

Number Theory

On Elliptic Sequences over Commutative Rings

We define elliptic sequences over a commutative ring as sequences indexed by the (positive) integers satisfying a 4-parameter, highly symmetric family of homogeneous quartic relations among terms which we call elliptic relations. We classify elliptic sequences over a field into three types, and show that most of them are dilated multiples of standard elliptic divisibility sequences (EDSs) which form countably many 4-dimensional families. In particular, we show standard EDSs are elliptic in a purely algebraic way using intricate implications among elliptic relations, without relying on complex analytic theory of Weierstrass functions. We shall use results presented here to give a purely algebraic treatment of division polynomials in a follow-up paper.
Read the full abstract

Numerical Analysis

An adaptive radial basis function approach for efficiently solving multidimensional spatiotemporal integrodifferential equations

In this work, we propose an adaptive radial basis function (RBF) approach for the efficient solution of multidimensional spatiotemporal integrodifferential equations. Our approach can automatically adjust the shape of RBFs and provide an easy-to-implement and mesh-free approach for solving spatiotemporal equations. Specifically, we analyze how the proposed method mitigates the curse of dimensionality by adaptively adjusting the scales and centers of the radial basis functions when the solution is spatially anisotropic. Through a range of numerical examples, we demonstrate the effectiveness of our approach for solving multidimensional spatiotemporal integrodifferential equations.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Price-Coordinated Mean Field Games with State Augmentation for Decentralized Battery Charging

This paper addresses the decentralized coordinated charging problem for a large population of battery storage agents (e.g. residential batteries, electrical vehicles, charging station batteries) using Mean Field Game (MFG). Agents are assumed to have affine dynamics and are coupled through a price that is continuous and monotonically increasing with respect to the difference between the average charging power and the grid's desired average charging power. An important modeling feature of the proposed framework is the state augmentation, that is, the charging power is treated as a state variable and its rate of change (i.e. the ramp rate) as the control input. The resulting MFG equilibrium is characterized by two nonlinearly coupled forward-backward differential equations. The existence and uniqueness of the MFG equilibrium is established for any continuous and monotonically increasing nonlinear price function without additional restrictions on the time horizon. Moreover, in the special case where the price is affine in the average charging power, we further simplify the characterization of the MFG equilibrium strategy via two separate Riccati equations, both of which admit unique positive semi-definite solutions without additional assumptions.
Read the full abstract

Monday 6 April

Information Theory · Cross-listed from cs.LG

eOptShrinkQ: Near-Lossless KV Cache Compression Through Optimal Spectral Denoising and Quantization

We show that the key-value (KV) cache in transformer attention heads admits a natural decomposition into a low-rank shared context component and a full-rank per-token residual, well described by the spiked random matrix model. This observation leads to eOptShrinkQ, a two-stage compression pipeline: optimal singular value shrinkage (eOptShrink) automatically extracts the shared structure, and the residual – which satisfies the thin shell property with delocalized coordinates – is quantized by TurboQuant~\citep{zandieh2025turboquant}, a recently proposed per-vector scalar quantizer with near-optimal distortion guarantees. By restoring the isotropy that scalar quantization assumes, spectral denoising eliminates the need for both outlier handling and dedicated inner product bias correction, freeing those bits for improved reconstruction. The theoretical grounding in random matrix theory provides three guarantees: automatic rank selection via the BBP phase transition, provably near-zero inner product bias on the residual, and coordinate delocalization ensuring near-optimal quantization distortion. Experimentally, we validate eOptShrinkQ on Llama-3.1-8B and Ministral-8B across three levels: per-head MSE and inner product fidelity, where eOptShrinkQ saves nearly one bit per entry over TurboQuant at equivalent quality; end-to-end on LongBench (16 tasks), where eOptShrinkQ at $\sim$2.2 bits per entry outperforms TurboQuant at 3.0 bits; and multi-needle retrieval, where eOptShrinkQ at 2.2 bits closely matches or exceeds uncompressed FP16, suggesting that spectral denoising can act as a beneficial regularizer for retrieval-intensive tasks.
Read the full abstract

Probability · Cross-listed from q-fin.RM

Ranking Metrics: Extending Acceptability and Performance Indexes

This paper develops an axiomatic framework for ranking metrics, a general class of functionals for evaluating and ordering financial or insurance positions. Unlike traditional risk-adjusted performance measures-such as the Sharpe ratio, RAROC, or Omega-that express reward per unit of risk, ranking metrics assign each position a performance level rather than a normalized return. Relying on monotonicity and a new property called cash-quasiconcavity, we derive representation results linking ranking metrics to families of acceptance sets and risk measures, extending the theory of acceptability indices. Classical ratios arise as special cases, while new examples-based on expected-loss, Lambda-quantile, and bibliometric indices-illustrate the framework's flexibility. Empirical applications to portfolio ranking and climate-risk insurance demonstrate its practical relevance.
Read the full abstract

All authors Asmerilda Hitaj, Elisa Mastrogiacomo, Ilaria Peri, Marcelo Righi

Information Theory · Cross-listed from eess.SP

Beyond the Flat-Spike: Adaptive Sparse CCA for Decaying and Unbalanced Signals

Sparse Canonical Correlation Analysis (SCCA) is a fundamental statistical tool for identifying linear relationships in high-dimensional, multi-view data. While minimax theory establishes an optimal sample complexity scaling additively with the sparsity levels of the canonical vectors, computationally efficient algorithms typically suffer from a suboptimal multiplicative dependence. This computational-statistical gap is intrinsically tied to worst-case “flat” signal assumptions. In practice, however, multi-view signals frequently exhibit structured energy concentration, such as a power-law decay. To exploit this structural concentration and bypass the worst-case bottleneck, we propose Bilateral Spectral Energy Pursuit (Bi-SEP). Operating directly on the cross-covariance matrix, Bi-SEP is a stagewise adaptive algorithm that utilizes a proxy refinement step to dynamically track and capture cross-view signal energy. Theoretically, we establish a profile-adaptive sample complexity bound governed by the coupled energy profiles of the two views. Notably, under power-law decay models, we reveal a synergistic phase transition: the optimal linear sample complexity is attainable provided that the aggregate decay rate of the two views is sufficiently large. This result demonstrates that a highly concentrated signal in one view allows the model to accommodate a completely flat signal in its partner. Numerical experiments validate our theoretical findings, illustrating the advantages of Bi-SEP in structured, non-flat signal regimes.
Read the full abstract

Differential Geometry

Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks

This thesis is an exposition of Ollivier-Ricci Curvature of metric spaces as introduced by Yann Ollivier, which is based upon the 1-Wasserstein Distance and optimal transport theory. We present some of the major results and proofs that connect Ollivier-Ricci curvature with classical Ricci curvature of Riemannian manifolds, including extensions of various theoretical bounds and theorems such as Bonnet-Myers and Levy-Gromov. Then we shift to results introduced by Lin-Lu-Yau on an extension of Ollivier-Ricci curvature on graphs, as well as the work of Jost-Liu on proving various combinatorial bounds for graph Ollivier-Ricci curvature. At the end of this thesis we present novel ideas and proofs regarding extensions of these results to directed graphs, and finally applications of graph-based Ollivier-Ricci curvature to various algorithms in network science and graph machine learning.
Read the full abstract

General Mathematics

Least Consecutive Pair of Primitive Roots

Let $p>1$ be a large prime number and let $x=O((\log p)^2(\log\log p)^5$ be a real number. It is proved that the least consecutive pair of primitive roots $u\ne\pm1, v^2$ and $u+1$ satisfies the upper bound $u\ll x$ in the prime field $\mathbb{F}_p$.

Numerical Analysis · Cross-listed from cs.MS

Accurate Residues for Floating-Point Debugging

Floating-point arithmetic is error-prone and unintuitive. Floating-point debuggers instrument programs to monitor floating-point arithmetic at run time and flag numerical issues. They estimate residues, i.e., the difference between actual floating-point and ideal real values, for every floating-point value in the program. Prior work explores various approaches for computing these residues accurately and efficiently. Unfortunately, the most efficient methods, based on "error-free transformations", have a high rate of false reports, while the most accurate methods, based on high-precision arithmetic, are very slow. This paper builds on error-free-transformations-based approaches and aims to improve their accuracy while preserving efficiency. To more accurately compute residues, this paper divides residue computation into two steps (rounding error computation and residue function evaluation) and shows how to perform each step accurately via careful improvements to the current state of the art. We evaluate on 44 large scientific computing workloads, focusing on the 14 benchmarks where prior tools produce false reports: our approach eliminates false reports on 10 benchmarks and substantially reduces them on the remaining 3 benchmarks. Moreover, complex numerical issues require additional care due to absorption, where two machine-precision residues cannot both be computed accurately in a single execution. This paper introduces residue override, which re-executes the program multiple times, computing different residues in different executions and assembling a final "patchwork" execution. We evaluate on 169 standard benchmarks drawn from numerical analysis papers and textbooks, requiring only 3.6 re-executions on average. Among 34 benchmarks with false reports in the initial run, residue override is triggered on 29 of them and reduces false reports on 25 of them, averaging 7.1 re-executions.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Universal Ladder Structure Across Scales: From Quantum to Black Hole Physics

Second-order ordinary linear differential equations appear ubiquitously across physics, describing the behavior of systems from the quantum world of atoms to the classical world of gravitating bodies. We present a unified symmetry-based framework that provides a “litmus-test criterion” to determine when such a system admits a hierarchical ladder structure, and, whenever it does, explicitly constructs the ladder. This approach uncovers a previously underappreciated connection to supersymmetric quantum mechanics and a deep commonality among diverse physical problems. Applications to the quantum harmonic oscillator and dynamical tidal response of Kerr black holes are presented to illustrate the framework.
Read the full abstract

All authors Rajes Ghosh, Rajendra Prasad Bhatt, Sumanta Chakraborty, Sukanta Bose

Mathematical Physics · Cross-listed from hep-th

Residual Symmetries and Their Algebras in the Kerr-Schild Double Copy

The Kerr-Schild double copy (KSDC) is well-known for relating exact classical solutions between Yang-Mills theory and theories of gravity. However, whether this correspondence provides a more fundamental mapping between the underlying symmetries of gauge theory and gravity remains an underdeveloped area of research in the contemporary double copy program. In this paper, we demonstrate that the KSDC correspondence does not provide a mapping between the residual symmetry structures of the Kerr-Schild ansatz in Yang-Mills theory and gravity. On the gauge theory side, residual symmetries form an infinite-dimensional algebra of functions along null directions. On the gravitational side, residual diffeomorphisms preserving the Kerr-Schild form of the Schwarzschild metric generate a conformal algebra on $S^2$, which decomposes into Killing vectors and proper conformal Killing vectors (CKVs). While the Killing sector reproduces the expected global isometries, the CKV sector yields an infinite-dimensional algebra after imposing asymptotic flatness and horizon regularity. This appears to contradict the fact that the Schwarzschild solution admits no proper conformal symmetries. We resolve this apparent contradiction by constructing a Weyl-compensated BRST complex, showing that the CKV sector is BRST-exact and therefore trivial in cohomology, so that the physical symmetry algebra reduces to the global isometries of Schwarzschild. This demonstrates that the KSDC introduces an enlarged symmetry structure at the level of the ansatz, but preserves physical symmetries after a cohomological reduction, revealing a fundamental mismatch between Yang-Mills and gravity at the level of residual symmetries.
Read the full abstract