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)

Monday 20 April

Optimization and Control

Learning the Riccati solution operator for time-varying LQR via Deep Operator Networks

We propose a computational framework for replacing the repeated numerical solution of differential Riccati equations in finite-horizon Linear Quadratic Regulator (LQR) problems by a learned operator surrogate. Instead of solving a nonlinear matrix-valued differential equation for each new system instance, we construct offline an approximation of the associated solution operator mapping time-dependent system parameters to the Riccati trajectory. The resulting model enables fast online evaluation of approximate optimal feedbacks across a wide class of systems, thereby shifting the computational burden from repeated numerical integration to a one-time learning stage. From a theoretical perspective, we establish control-theoretic guarantees for this operator-based approximation. In particular, we derive bounds quantifying how operator approximation errors propagate to feedback performance, trajectory accuracy, and cost suboptimality, and we prove that exponential stability of the closed-loop system is preserved under sufficiently accurate operator approximation. These results provide a framework to assess the reliability of data-driven approximations in optimal control. On the computational side, we design tailored DeepONet architectures for matrix-valued, time-dependent problems and introduce a progressive learning strategy to address scalability with respect to the system dimension. Numerical experiments on both time-invariant and time-varying LQR problems demonstrate that the proposed approach achieves high accuracy and strong generalization across a wide range of system configurations, while delivering substantial computational speedups compared to classical solvers. The method offers an effective and scalable alternative for parametric and real-time optimal control applications.
Read the full abstract

Information Theory

Bayesian experimental design: grouped geometric pooled posterior via ensemble Kalman methods

Bayesian experimental design (BED) for complex physical systems is often limited by the nested inference required to estimate the expected information gain (EIG) or its gradients. Each outer sample induces a different posterior, creating a large and heterogeneous set of inference targets. Existing methods have to sacrifice either accuracy or efficiency: they either perform per-outer-sample posterior inference, which yields higher fidelity but at prohibitive computational cost, or amortize the inner inference across all outer samples for computational reuse, at the risk of degraded accuracy under posterior heterogeneity. To improve accuracy and maintain cost at the amortized level, we propose a grouped geometric pooled posterior framework that partitions outer samples into groups and constructs a pooled proposal for each group. While such grouping strategy would normally require generating separate proposal samples for different groups, our tailored ensemble Kalman inversion (EKI) formulation generates these samples without extra forward-model evaluation cost. We also introduce a conservative diagnostic to assess importance-sampling quality to guide grouping. This grouping strategy improves within-group proposal-target alignment, yielding more accurate and stable estimators while keeping the cost comparable to amortized approaches. We evaluate the performance of our method on both Gaussian-linear and high-dimensional network-based model discrepancy calibration problems.
Read the full abstract

Number Theory

A primality test for $Kp^\ell - 1$ numbers

We develop an algebraic framework over arbitrary quadratic fields $L = \mathbb{Q}(\sqrt{D})$ to generalize the Miller-Rabin primality test. Consequently, we present a deterministic primality test for integers of the form $N = K p^{\ell} - 1$ that requires only a single modular exponentiation and achieves a computational complexity of $\tilde{\mathcal{O}}(\log^2 N)$. Furthermore, we also establish an analogue of Korselt's criterion within this setting. Finally, computational data generated using SageMath confirm its efficiency, successfully establishing the primality of numbers in the associated quadratic field within milliseconds.
Read the full abstract

Numerical Analysis

Physics-Informed Neural Networks: A Didactic Derivation of the Complete Training Cycle

This paper is a step-by-step, self-contained guide to the complete training cycle of a Physics-Informed Neural Network (PINN) – a topic that existing tutorials and guides typically delegate to automatic differentiation libraries without exposing the underlying algebra. Using a first-order initial value problem with a known analytical solution as a running example, we walk through every stage of the process: forward propagation of both the network output and its temporal derivative, evaluation of a composite loss function built from the ODE residual and the initial condition, backpropagation of gradients – with particular attention to the product rule that arises in hidden layers – and a gradient descent parameter update. Every calculation is presented with explicit, verifiable numerical values using a 1-3-3-1 multilayer perceptron with two hidden layers and 22 trainable parameters. From these concrete examples, we derive general recursive formulas – expressed as sensitivity propagation relations – that extend the gradient computation to networks of arbitrary depth, and we connect these formulas to the automatic differentiation engines used in practice. The trained network is then validated against the exact solution, achieving a relative $L^2$ error of $4.290 \times 10^{-4}$ using only the physics-informed loss, without any data from the true solution. A companion Jupyter/PyTorch notebook reproduces every manual calculation and the full training pipeline, providing mutual validation between hand-derived and machine-computed gradients.
Read the full abstract

Rings and Algebras

Skew fields not finitely generated as algebras

An associative division algebra D is said to be _affine_ over a central subfield k if D is finitely generated as a k-algebra. In 1956 Amitsur famously proved that, when k is uncountable, D cannot be k-affine unless D is algebraic over k. In this paper we consider affineness – and nonaffineness – for certain naturally occurring classes of division algebras over arbitrary fields. The primary applications are to division algebras of fractions of suitably conditioned iterated skew polynomial rings over k, including many examples naturally arising in Lie theoretic and quantum group settings. Many transcendental division algebras are thus verified to be nonaffine over k. Division algebras of fractions of Weyl algebras and quantum affine spaces are determined to be affine over their centers exactly when they are finite dimensional over their centers.
Read the full abstract

2604.18480 · 20 Apr · Revised. To appear in Contemporary Mathematics, combined proceedings for the workshops "Revisiting Fundamental Problems: Infinite Dimensional Division Algebras – Algebraicity and Finiteness" and the "Seattle Noncommutative Algebra Conference." Title has been shortened, per referee's recommendation, from the original, "`New' examples of skew fields not finitely generated as algebras."

Group Theory

On the Independence Number of the Prime-Coprime Graph of a Finite Group

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all finite groups $G$ for which $\Theta(G)$ is a split graph. We establish a general lower bound for the independence number of $\Theta(G)$ of an arbitrary finite group $G$. Moreover, we explicitly compute the independence number of $\Theta(G)$ for several distinguished families of finite groups, including cyclic, dihedral, dicyclic, and semidihedral groups.
Read the full abstract

All authors Ravi Ranjan, Shubh Narayan Singh, Surbhi Kumari, Shidra Jamil

Mathematical Physics · Cross-listed from gr-qc

New bounds for the area of MOTS and generalized ultra-massive spacetimes

Bounds for the area of general closed marginally trapped surfaces (MTSs) are presented. They do not require any stability condition, and are determined by a constant that depends on a particular component of the Einstein tensor on the surface and another constant that governs the (in)stability of the MTS. When stability is imposed, the area bounds are refined. These bounds are realized in spacetimes exhibiting interesting generic properties: they possess marginally trapped tubes foliated by marginally trapped topological spheres containing a distinguished round sphere $\bar S$ with constant Gaussian curvature that saturates the area bound. This distinguished surface separates two distinct regions of the marginally trapped tubes: a dynamical horizon and a timelike membrane. The particular case where there is a positive cosmological constant leads to the well-known universal bound $4\pi/ \Lambda$ for spatially stable MTSs, and to the recently introduced `ultra-massive spacetimes'. These spacetimes are more extreme than black holes, as there is no event horizon and the entire exterior region undergoes unavoidable collapse. In this paper similar behaviour is found for non-positive $\Lambda$ if the energy-momentum content is powerful enough. The results may have implications for binary mergers and on accreting very compact objects.
Read the full abstract

Numerical Analysis

High-fidelity and Network-based Spatio-temporal Mathematical Models of Alzheimer's Disease Progression and their Validation Against PET-SUVR Imaging Data

Alzheimer's disease is the most common neurodegenerative disorder. Its pathological development is connected with the misfolding and accumulation of two toxic proteins: amyloid-beta and tau proteins. Mathematical models provide a valuable quantitative tool for monitoring disease progression. In this work, we proposed and compare a novel framework where the spatio-temporal dynamics of amyloid-beta and tau proteins is modeled based on employing either three-dimensional patient-specific geometries or through reduced network-based models defined on the brain connectome. More specifically, a high-fidelity biophysical model is proposed on three-dimensional brain geometries reconstructed from magnetic resonance imaging, whereas a network-based reduced formulation is defined on the brain connectome. For both approaches, a suitable numerical discretisation is proposed. A sensitivity analysis is presented to quantify the influence of model parameters on protein concentration patterns as well as compare the quality of the predictions. For both approaches, the results are validated against PET-SUVR clinical data using 18FAZD4694 for amyloid-beta and 18FMK6240 for tau protein. The results indicate that the three-dimensional model provides the most accurate and biologically consistent description of the disease progression, but remains computationally demanding. On the other hand, the reduced graph-based model is cheaper, but it is not always able to achieve reliable results.
Read the full abstract

All authors Beatrice Caon, Mattia Corti, Francesca Bonizzoni, Paola F. Antonietti

Algebraic Geometry

On the quasi-monomiality of the $\alpha$- and $\delta$-invariants

In this paper, we show that for any projective klt pair $(X,\Delta)$ over an algebraically closed field of characteristic \(0\) and any big $\mathbb{Q}$-Cartier $\mathbb{Q}$-divisor $L$ on $X$, the invariants $\alpha(X,\Delta,L)$ and $\delta(X,\Delta,L)$ are computed by quasi-monomial valuations, without any uncountability assumption on the base field.
Read the full abstract

Analysis of PDEs

Spectral theory of plasmonic resonances in the nonlocal regime

We present a rigorous spectral analysis of plasmonic resonances in the nonlocal regime of spatially dispersive media. We adopt the quasi-static approximation of the hydrodynamic Drude model, which provides an analytically tractable setting to account for nonlocal effects. By reformulating the governing equations as a boundary integral system, we obtain an analytic Fredholm operator pencil that characterizes resonant behaviour. This framework enables the study of nonlocal plasmonic eigenvalues in general bounded Lipschitz domains, together with a corresponding resonant expansion of the scattered field. Our main result reveals a fundamental change in spectral structure: in contrast to the local theory – which exhibits infinitely many surface plasmon modes and field singularities in domains with corners – the nonlocal model admits a discrete real spectrum with a single accumulation point at a strictly positive value. Consequently, only finitely many surface plasmon modes exist, and the singular behaviour associated with sharp geometries is regularized. As such, our results show that nonlocality does not merely shift plasmonic resonances but completely reshapes the spectral landscape in a way that provides a mathematically transparent explanation for several nonlocal phenomena previously observed in numerical studies.
Read the full abstract

Operator Algebras

$C^*$-simplicity, confined subalgebras, and operator algebraic uniform recurrence

We introduce the notion of confined subalgebras in the context of the group von Neumann algebra. We also define Uniformly Recurrent States – an operator-algebraic analog of Uniformly Recurrent Subgroups. Using this framework, we show that a countable discrete group is $C^*$-simple if and only if it admits no non-trivial amenable confined subalgebras. This generalizes the well-known result of Kennedy that characterizes $C^*$-simplicity in terms of trivial amenable uniformly recurrent subgroups.
Read the full abstract

Algebraic Topology

Equivariant rigidity of complex and quaternionic moment–angle manifolds

We investigate equivariant rigidity properties of complex and quaternionic moment–angle manifolds. By reducing the classification problem to the equivariant rigidity of their quasitoric or quoric quotients and by using the associated principal bundle structures, we establish rigidity results within the category of locally linear actions. We prove that complex moment–angle manifolds are equivariantly rigid up to homeomorphism: any closed locally linear manifold equivariantly homotopy equivalent to a complex moment–angle manifold is equivariantly homeomorphic to it. In the quaternionic setting, under Hopkinson's globality condition on the characteristic data, we obtain the analogous equivariant homeomorphism rigidity for quaternionic moment–angle manifolds. These results show that, in the equivariant category considered here, the equivariant homotopy type of a moment–angle manifold determines its equivariant homeomorphism type.
Read the full abstract

Optimization and Control

Geometric Trajectory Optimization for TRACON Arrivals: An NLP Approach with ATC Vectoring Maneuver Modeling

Terminal airspace congestion remains a major bottleneck in the global air traffic network. Although the Aircraft Sequencing and Scheduling Problem (ASSP) has been widely studied, many methods rely on simplified node-link abstractions that ignore the practical flight path, producing schedules that can be hard to execute under real airspace geometric constraints. This paper introduces a high-fidelity trajectory optimization framework for Terminal Arrival Sequencing and Scheduling (TASS) that explicitly models controller vectoring maneuvers. We formulate a single-stage nonlinear programming (NLP) model with a weighted objective function that optimizes Baseleg path extension and segment-wise speed profiles for arriving aircraft. The model enforces nonlinear geometric coupling between Baseleg extensions and the required Radius-to-Fix (RF) turn for Final Approach Fix (FAF) intercept through closed-form expressions. Under the First-Come-First-Served (FCFS) rule, it generates separated, operationally feasible trajectories aligned with controller practice. Monte Carlo simulations with ample runs on the A80 TRACON in Atlanta demonstrate minimal separation violations below the runway capacity threshold through tactical path stretching, with violations occurring only when arrival rates exceed the maximum tolerable rate.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

On the Effect of Quadratic Regularization in Direct Data-Driven LQR

This paper proposes an explainability concept for direct data-driven linear quadratic regulation (LQR) with quadratic regularization. Our perspective follows the parametric effect of regularization, an analysis approach that translates regularization costs from auxiliary variables to system quantities, enabling intuitive interpretations. The framework further enables the elimination of auxiliary variables, thereby reducing computational complexity. We demonstrate the effectiveness of our approach and the identified effect of regularization via simulations.
Read the full abstract

All authors Manuel Klädtke, Feiran Zhao, Florian Dörfler, Moritz Schulze Darup

Statistics Theory · Cross-listed from stat.ML

Random Matrix Theory of Early-Stopped Gradient Flow: A Transient BBP Scenario

Empirical studies of trained models often report a transient regime in which signal is detectable in a finite gradient descent time window before overfitting dominates. We provide an analytically tractable random-matrix model that reproduces this phenomenon for gradient flow in a linear teacher–student setting. In this framework, learning occurs when an isolated eigenvalue separates from a noisy bulk, before eventually disappearing in the overfitting regime. The key ingredient is anisotropy in the input covariance, which induces fast and slow directions in the learning dynamics. In a two-block covariance model, we derive the full time-dependent bulk spectrum of the symmetrized weight matrix through a $2\times 2$ Dyson equation, and we obtain an explicit outlier condition for a rank-one teacher via a rank-two determinant formula. This yields a transient Baik-Ben Arous-Péché (BBP) transition: depending on signal strength and covariance anisotropy, the teacher spike may never emerge, emerge and persist, or emerge only during an intermediate time interval before being reabsorbed into the bulk. We map the corresponding phase diagrams and validate the theory against finite-size simulations. Our results provide a minimal solvable mechanism for early stopping as a transient spectral effect driven by anisotropy and noise.
Read the full abstract

Mathematical Physics

Kernel-Preserving Dynamics and Symmetry Classification for Synchronization Subspaces

We study the preservation and stability of synchronization subspaces in tensor products of finite-dimensional Hilbert spaces. Given self-adjoint operators $T_A$ and $T_B$ on local subsystems, the synchronization subspace is defined as the kernel of the difference operator $K = T_A \otimes I - I \otimes T_B$. We establish two main results: First for $\epsilon$-compatible dynamics satisfying $||[H,K]|| \leq \epsilon$, we prove a sharp drift bound where any initially synchronized state deviates from the kernel at a rate at most linear in time with slope $\epsilon$. We show by explicit construction that this estimate is optimal to leading order. Second in the presence of finite group symmetry, we show that the synchronization subspace coincides with the diagonal isotypic component in the tensor product decomposition and we characterize the algebra of synchronization-preserving dynamics as the intersection of the commutants of the group action and synchronization operator.
Read the full abstract

Spectral Theory

Wave operators for Jacobi matrices

We study the wave operators for a Jacobi matrix whose spectral measure satisfies the Szegö condition. We prove existence and completeness of wave operators under a mild additional assumption on the Verblunsky coefficients of the associated measure on the unit circle.

Statistics Theory

Conformal Robust Set Estimation

We introduce a robust conformal prediction method based on the half-mass radius $\dP(x):=\inf\{r>0:P(B(x,r))>1/2\}$. Its empirical version is exactly the distance from a point to its $\mathbf{k}$-th nearest neighbour, with $\mathbf{k}=\lfloor n/2\rfloor+1$. The resulting conformal sets retain finite-sample marginal validity and asymptotically target the robust population central set $\Qba:=\{x\in\R^d:\dP(x)\le\beta_\alpha\}$. We prove consistency in symmetric-difference probability, derive non-asymptotic exponential bounds and obtain the rate $O((\log n/n)^{1/2})$ under a local mass condition. Under the same local regularity on the uncontaminated law, we also establish quantitative $O(\eta)$ stability, uniformly over arbitrary contaminations of sufficiently small mass $\eta$, prove Hausdorff convergence of the empirical central sets, and provide computable ball-based representations using only pairwise distances.
Read the full abstract

Algebraic Geometry

Unirational algebraic groups and tame ramification

Let $\mathcal{O}_K$ be a complete discrete valuation ring with field of fractions $K$ and algebraically closed residue field $k.$ Let $G$ be a smooth connected commutative algebraic group over $K$ which does not contain a copy of $\mathbf{G}_{\mathrm{a}}.$ For each $d$ prime to $p:=\mathrm{char}\, k,$ let $K(d)$ be the unique extension of $K$ of degree $d.$ We investigate how the Néron lft-model of $G$ behaves under base change to the ring of integers $\mathcal{O}_{K(d)}.$ Information about this behaviour is encoded in the "jumps" of Edixhoven's filtration on the special fibre of the Néron lft-model of $G,$ as well as in Halle-Nicaise's motivic zeta function of $G.$ If $G$ is unirational (e. g. an algebraic torus), we show that the jumps of $G$ are rational numbers and that the motivic zeta function of $G$ is a rational function. We also deduce analogous results for Abelian varieties with potentially totally multiplicative reduction. This answers a question of Halle-Nicaise and partially one of Edixhoven. Along the way, we answer a question of Oesterlé about the structure of unipotent algebraic groups over function fields in positive characteristic. Under stronger conditions on $G,$ we obtain rationality of jumps even for separably closed but imperfect $k.$
Read the full abstract

Number Theory

Families of symplectic Galois representations over small parabolic eigenvarieties for Siegel cuspforms of genus $2$

We construct small parabolic eigenvarieties for holomorphic Siegel cuspforms of genus $2$ and study families of Galois representations attached to them in the spirit of Bellaïche–Chenevier. In the course, we introduce the notion of $(\varphi, \Gamma)$-modules with $G$-structures and the notion of refined families of symplectic Galois representations by implementing the theory of symplectic Galois determinant d'après Moakher–Quast. Such families of symplectic Galois representations provide two applications: In the first application, we show that the small parabolic eigenvarieties are smooth at non-critical points by proving an infinitesimal $R=\mathbb{T}$ theorem. In the second application, we study the relationship between the geometry of the small parabolic eigenvarieties at the Saito–Kurokawa lifts for cuspidal eigenforms (both finite- and infinite-slope) and the Bloch–Kato Selmer groups of those eigenforms.
Read the full abstract

Optimization and Control

Real-Time Algorithms for Model Predictive Control of Hybrid Dynamical Systems

Model predictive control (MPC) of hybrid dynamical systems is challenging because the associated optimization problem is nonsmooth and the resulting feedback law is discontinuous. This paper develops real-time MPC algorithms for nonlinear hybrid systems modeled as dynamical complementarity systems. The resulting optimal control problems are formulated as mathematical programs with complementarity constraints (MPCCs). We show that the solution map of parametric MPCCs is discontinuous, and that standard nonlinear-programming-based approaches may become infeasible when the hybrid system switches. To address this, we introduce three real-time hybrid MPC schemes whose feedback phase solves a quadratic program with complementarity constraints per sample, yielding local discontinuous piecewise affine approximations of the MPC feedback law. Moreover, we derive continuity and differentiability results for parametric MPCCs, and establish conditions under which the approximation error of our new hybrid MPC algorithms remains uniformly bounded despite solution discontinuities. The algorithms are demonstrated on a robotic manipulation example, where contact sequences are discovered online.
Read the full abstract

Probability

Expected perimeter and area of the convex hull of planar Brownian motion stopped upon exiting the unit disk

We study the convex hull of planar Brownian motion run until the exit time from the unit disk. Our primary objectives are to compute the expected perimeter and expected area of this convex hull, thereby complementing recent results on the convex hull of reflecting Brownian motion in confined geometries. We reduce the problem of computing the expected perimeter to computing the expected value of the Brownian motion's maximum horizontal displacement at the exit time, and then recast this maximum in terms of harmonic measure in a domain we call the truncated disk. The problem of computing the expected area is reduced to computing the expected value of the difference of squares of the Brownian motion's maximum horizontal displacement at the exit time, and the value of the vertical displacement at the time this maximum horizontal displacement is achieved. In particular, we obtain exact expressions for both the expected perimeter and the expected area. We conclude with further results on the expected areas of two related hulls of the Brownian path run until exiting the disk, namely, the star hull and topological hull.
Read the full abstract

Information Theory · Cross-listed from cs.IR

Context-Aware Search and Retrieval Under Token Erasure

This paper introduces and analyzes a search and retrieval model for RAG-like systems under {token} erasures. We provide an information-theoretic analysis of remote document retrieval when query representations are only partially preserved. The query is represented using term-frequency-based features, and semantically adaptive redundancy is assigned according to feature importance. Retrieval is performed using TF-IDF-weighted similarity. We characterize the retrieval error probability by showing that the vector of similarity margins converges to a multivariate Gaussian distribution, yielding an explicit approximation and computable upper bounds. Numerical results support the analysis, while a separate data-driven evaluation using embedding-based retrieval on real-world data shows that the same importance-aware redundancy principles extend to modern retrieval pipelines. Overall, the results show that assigning higher redundancy to semantically important query features improves retrieval reliability.
Read the full abstract

All authors Sara Ghasvarianjahromi, Joshua Barr, Yauhen Yakimenka, Jörg Kliewer

Numerical Analysis · Cross-listed from cs.LG

Balance-Guided Sparse Identification of Multiscale Nonlinear PDEs with Small-coefficient Terms

Data-driven discovery of governing equations has advanced significantly in recent years; however, existing methods often struggle in multiscale systems where dynamically significant terms may have small coefficients. Therefore, we propose Balance-Guided SINDy (BG-SINDy) inspired by the principle of dominant balance, which reformulates $\ell_0$-constrained sparse regression as a term-level $\ell_{2,0}$-regularized problem and solves it using a progressive pruning strategy. Terms are ranked according to their relative contributions to the governing equation balance rather than their absolute coefficient magnitudes. Based on this criterion, BG-SINDy alternates between least-squares regression and elimination of negligible terms, thereby preserving dynamically significant terms even when their coefficients are small. Numerical experiments on the Korteweg–de Vries equation with a small dispersion coefficient, a modified Burgers equation with vanishing hyperviscosity, a modified Kuramoto–Sivashinsky equation with multiple small-coefficient terms, and a two-dimensional reaction–diffusion system demonstrate the validity of BG-SINDy in discovering small-coefficient terms. The proposed method thus provides an efficient approach for discovering governing equations that contain small-coefficient terms.
Read the full abstract

All authors Zhenhua Dang, Lei Zhang, Long Wang, Guowei He

Operator Algebras

Crossed product C*-algebras associated with non-minimal actions on the circle

We examine crossed product C*-algebras associated with free non-minimal actions of countably infinite discrete abelian groups on the circle, extending the work of Putnam, Schmidt, and Skau. We obtain a large class of unital separable nuclear and non-simple C*-algebras that are quasidiagonal, have stable rank one, and admit a unique tracial state. We determine their ideal structure and establish an improved uniform upper bound for their nuclear dimension. Finally, in the case $G = \mathbb{Z}^d$, we compute the K-theory and trace pairing map.
Read the full abstract

Analysis of PDEs

Function spaces and potential theory in the Orlicz setting

In this article, we study certain transcendental function spaces arising in potential theory within the framework of Orlicz spaces. Specifically, we generalize Bessel and Lizorkin-Triebel spaces to the nonstandard setting of Orlicz spaces. We recover classical results from potential theory, such as the fact that Bessel-Orlicz spaces of integer order coincide with Orlicz-Sobolev spaces (Calderón type theorem), and we establish inclusion results for fractional orders. Moreover, we prove a Strauss-type lemma for potential spaces. In the last sections, we show that certain Orlicz-Lizorkin-Triebel spaces coincide with Bessel-Orlicz spaces, and we provide a useful atomic decomposition for these spaces.
Read the full abstract

Numerical Analysis

Virtual element methods for a quad-curl problem on general planar domains

We design and analyze virtual element methods for a quad-curl problem on general polygonal domains that are based on the Hodge decomposition of divergence-free vector fields. Numerical results that corroborate the theoretical analysis are also presented.

Logic · Cross-listed from cs.LO

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules

We introduce cut-free nested sequent systems for a broad class of quantified modal logics (QMLs). The QMLs we consider are semantically defined using relational models that assign both an inner and outer domain to each world. This rich model structure enables the specification of various QMLs by enforcing different frame conditions, including increasing, decreasing, constant, and empty domains, as well as general path conditions and seriality. We extend the usual notion of nested sequent to include signatures, i.e., multisets of terms, which let us naturally define rules capturing the aforementioned domain conditions. A distinctive feature of our nested sequent systems is the use of reachability rules–inference rules parameterized by formal grammars (viz., semi-Thue systems). These rules operate by propagating or consuming formulae or terms along certain paths within a nested sequent, where paths are encoded as strings generated by a parameterizing grammar. This paper is the first to provide sound and complete nested systems for QMLs semantically characterized by models using both inner and outer domains. We analyze the proof-theoretic properties of these systems, identify a number of admissible structural rules, establish the invertibility of all rules, and prove a non-trivial syntactic cut-elimination theorem. We also observe that the standard universal quantifier rule used in nested systems subsumes the Extended Barcan Rule, which forces nested systems to capture QMLs with constant outer domains.
Read the full abstract

Dynamical Systems · Cross-listed from stat.ML

Adaptive Kernel Selection for Kernelized Diffusion Maps

Selecting an appropriate kernel is a central challenge in kernel-based spectral methods. In Kernelized Diffusion Maps (KDM), the kernel determines the accuracy of the RKHS estimator of a diffusion-type operator and hence the quality and stability of the recovered eigenfunctions. We introduce two complementary approaches to adaptive kernel selection for KDM. First, we develop a variational outer loop that learns continuous kernel parameters, including bandwidths and mixture weights, by differentiating through the Cholesky-reduced KDM eigenproblem with an objective combining eigenvalue maximization, subspace orthonormality, and RKHS regularization. Second, we propose an unsupervised cross-validation pipeline that selects kernel families and bandwidths using an eigenvalue-sum criterion together with random Fourier features for scalability. Both methods share a common theoretical foundation: we prove Lipschitz dependence of KDM operators on kernel weights, continuity of spectral projectors under a gap condition, a residual-control theorem certifying proximity to the target eigenspace, and exponential consistency of the cross-validation selector over a finite kernel dictionary.
Read the full abstract

All authors Othmane Aboussaad, Adam Miraoui, Boumediene Hamzi, Houman Owhadi