Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Saturday 28 February

Mathematical Physics

From Bopp Shifts to Toroidal Shadows: K-Theoretic Gap Labels in Noncommutative Quantum Mechanics

We study Bopp shifts in two-dimensional noncommutative quantum mechanics (NCQM) through a functorial lens. A nondegenerate NCQM sector with central character $(\hbar,\vartheta,B_{\rm in})$ determines a self-adjoint infinitesimal representation of the NCQM Lie algebra $\mathfrak{g}_{\rm NC}$. A Darboux normalization of its represented phase-space operators produces a self-adjoint infinitesimal representation of the Weyl-Heisenberg Lie algebra $\mathfrak{g}_{\rm WH}$ with central parameter $\hbar$, and hence defines a Bopp-shift functor collapsing $(\hbar,\vartheta,B_{\rm in}) \mapsto \hbar$. In particular, a generic NCQM sector is not equivalent, as a $\mathfrak{g}_{\rm NC}$-sector, to the ordinary QM sector $(\hbar,0,0)$, even though their Bopp-shift images have the same Weyl-Heisenberg parameter. To measure what this collapse forgets, we construct a toroidal shadow functor assigning to each periodic datum $L=(a_x,a_y)$ and each NCQM sector $\chi$ a phase-space noncommutative four-torus $A^4_{\Theta_{\chi,L}}$. Its $K_0$-trace pairing yields sector-sensitive gap labels whose top-degree coefficient is $(\vartheta B_{\rm in}-\hbar)/((2\pi)^2\hbar)$. This coefficient is independent of the spatial cell area $a_xa_y$ and equals the Pfaffian ${\rm Pf}(\Theta_{\chi,L})$, the top-degree generator of the $K_0$-trace range. Since strong Morita equivalence preserves this trace range up to positive scaling, non-proportionality of the trace ranges obstructs Morita equivalence of the shadows, separating equal-$\hbar$ sectors that the Bopp-shift functor identifies. In the arithmetic subfamily where $\vartheta/A$ and $B_{\rm in}A/\hbar$ are algebraic, the trace-range scale is forced to be trivial and $|{\rm Pf}|$ becomes a computable separation criterion: $|\vartheta B_{\rm in}-\hbar| \neq |\vartheta' B'_{\rm in}-\hbar|$ already implies inequivalence.
Read the full abstract

Optimization and Control

Enhanced Hydrogen Electrolyzer with Integrated Energy Storage to Provide Grid-Forming Services for Off-Grid ReP2H Application

This article proposes an energy storage-enhanced hydrogen electrolyzer (ESEHE) to provide grid-forming (GFM) services for off-grid renewable power to hydrogen (ReP2H) systems. Unlike conventional ReP2H systems that use a centralized energy storage (ES) plant, the proposed topology directly connects batteries to the DC buses of electrolysis rectifiers. A tailored virtual synchronous machine (VSM) control framework enables the electrolyzer to autonomously provide real and reactive power support. A coordinated frequency-splitting energy extraction strategy is designed to exploit both the battery and the electrolysis stack's electrical double-layer (EDL) effect on different timescales, maximizing active power support while mitigating battery and stack degradation. An adaptive equalization control strategy is further developed to balance the battery state of charge (SOC) among multiple ESEHEs operating in parallel, which optimizes energy distribution and extends battery life. Real-time simulations on StarSim validate the proposed topology and control strategies. Techno-economic analysis shows that, compared with conventional off-grid ReP2H systems based on a centralized ES plant, the ESEHE improves overall energy efficiency by 0.23% and reduces the initial total converter investment cost by roughly 6%, mainly due to the elimination of bidirectional AC/DC conversion and its associated losses in the centralized ES plant.
Read the full abstract

All authors Yiwei Qiu, Jiahao Hu, Yi Zhou, Jie Zhu, Li Jiang, Shi Chen, Buxiang Zhou

Probability

A note on uniform random covering problems in metric spaces

In this paper, we study the uniform random covering problem in general metric space $(X,d)$. Let $\omega=(\omega_n)_{n\in\mathbb N}$ be a sequence of independent identically distributed random variables on $(X,\mu)$, and $\ell=(\ell_n)_{n\in\mathbb N}$ a sequence of positive real numbers. We analyze the size of the set \[\mathcal{U}(\omega,\ell)=\left\{y\in X\colon \forall N\gg1,~\exists 1\le n\le N,~s.t. ~d(\omega_n,y)<\ell_N\right\},\] and establish the 0-1 law for the Hausdorff dimension of $\mathcal{U}(\omega,\ell)$, its measure and the event $\mathcal{U}(\omega,\ell)=X$. Some sufficient conditions are provided for $\mathcal{U}(\omega,\ell)$ to have full measure or be countable almost surely. Furthermore, we employ the local dimension of $\mu$ to estimate the Hausdorff dimension of $\mathcal{U}(\omega,\ell)$. While prior work by Koivusalo, Liao and Persson ( Int. Math. Res. Not. 2023) addressed the case of the torus $\mathbb{T}$, we apply our results to the $d$-dimensional torus $\mathbb{T}^d$, and explicit analysis of the Hausdorff dimension in a critical case is given.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Heaviside Low-Rank Support Matrix Machine

Support matrix machine (SMM) is an emerging classification framework that directly handles matrix-structured observations, thereby avoiding the spatial correlations destroyed by vectorization. However, most existing SMM variants rely on convex or nonconvex surrogate loss functions, which may lead to high sensitivity to noise. To address this issue, we propose a novel Heaviside low-rank SMM model called HL-SMM, which leverages the Heaviside loss instead of the common hinge or ramp losses for robustness. Moreover, the low-rank constraint is adopted to accurately characterize the inherent global structure. In theory, we analyze the Karush-Kuhn-Tucker (KKT) points and rigorously prove the sufficient and necessary conditions. In algorithms, we develop an effective proximal alternating minimization (PAM) scheme, where all subproblems have closed-form solutions. Extensive experiments on benchmark datasets validate that the proposed HL-SMM achieves superior classification accuracy and robustness compared to state-of-the-art methods.
Read the full abstract

All authors Xianchao Xiu, Shenghao Sun, Xinrong Li, Jiyuan Tao

Information Theory · Cross-listed from cs.CV

TokenCom: Vision-Language Model for Multimodal and Multitask Token Communications

Visual-Language Models (VLMs), with their strong capabilities in image and text understanding, offer a solid foundation for intelligent communications. However, their effectiveness is constrained by limited token granularity, overlong visual token sequences, and inadequate cross-modal alignment. To overcome these challenges, we propose TaiChi, a novel VLM framework designed for token communications. TaiChi adopts a dual-visual tokenizer architecture that processes both high- and low-resolution images to collaboratively capture pixel-level details and global conceptual features. A Bilateral Attention Network (BAN) is introduced to intelligently fuse multi-scale visual tokens, thereby enhancing visual understanding and producing compact visual tokens. In addition, a Kolmogorov Arnold Network (KAN)-based modality projector with learnable activation functions is employed to achieve precise nonlinear alignment from visual features to the text semantic space, thus minimizing information loss. Finally, TaiChi is integrated into a multimodal and multitask token communication system equipped with a joint VLM-channel coding scheme. Experimental results validate the superior performance of TaiChi, as well as the feasibility and effectiveness of the TaiChi-driven token communication system.
Read the full abstract

All authors Feibo Jiang, Siwei Tu, Li Dong, Xiaolong Li, Kezhi Wang, Cunhua Pan, Zhu Han, Jiangzhou Wang

Information Theory

Wireless Power Control Based on Large Language Models

This paper investigates the power control problem in wireless networks by repurposing pre-trained large language models (LLMs) as relational reasoning backbones. In hyper-connected interference environments, traditional optimization methods face high computational cost, while standard message passing neural networks suffer from aggregation bottlenecks that can obscure critical high-interference structures. In response, we propose PC-LLM, a physics-informed framework that augments a pre-trained LLM with an interference-aware attention bias. The proposed bias tuning mechanism injects the physical channel gain matrix directly into the self-attention scores, enabling explicit fusion of wireless topology with pre-trained relational priors without retraining the backbone from scratch. Extensive experiments demonstrate that PC-LLM consistently outperforms both traditional optimization methods and state-of-the-art graph neural network baselines, while exhibiting exceptional zero-shot generalization to unseen environments. We further observe that topology-relevant relational reasoning is concentrated in shallow layers, whereas deeper layers encode task-irrelevant semantic noise. Motivated by this finding, we develop a lightweight adaptation strategy that reduces model depth by 50%, significantly lowering inference cost while preserving state-of-the-art spectral efficiency.
Read the full abstract

All authors Jiacheng Wang, Yucheng Sheng, Le Liang, Hao Ye, Shi Jin

Optimization and Control · Cross-listed from cs.AI

Why Not? Solver-Grounded Certificates for Explainable Mission Planning

Operators of Earth observation satellites need justifications for scheduling decisions: why a request was selected, rejected, or what changes would make it schedulable. Existing approaches construct post-hoc reasoning layers independent of the optimizer, risking non-causal attributions, incomplete constraint conjunctions, and solver-path dependence. We take a faithfulness-first approach: every explanation is a certificate derived from the optimization model itself: minimal infeasible subsets for rejections, tight constraints and contrastive trade-offs for selections, and inverse solves for what-if queries. On a scheduling instance with structurally distinct constraint interactions, certificates achieve perfect soundness with respect to the solver's constraint model (15/15 cited-constraint checks), counterfactual validity (7/7), and stability (Jaccard = 1.0 across 28 seed-pairs), while a post-hoc baseline produces non-causal attributions in 29% of cases and misses constraint conjunctions in every multi-cause rejection. A scalability analysis up to 200 orders and 30 satellites confirms practical extraction times for operational batches.
Read the full abstract

Rings and Algebras · Cross-listed from cs.DB

Semijoins of Annotated Relations

The semijoin operation is a fundamental operation of relational algebra that has been extensively used in query processing. Furthermore, semijoins have been used to formulate desirable properties of acyclic schemas; in particular, a schema is acyclic if and only if it has a full reducer, i.e., a sequence of semijoins that converts a given collection of relations to a globally consistent collection of relations. In recent years, the study of acyclicity has been extended to annotated relations, where the annotations are values from some positive commutative monoid. So far, however, it has not been known if the characterization of acyclicity in terms of full reducers extends to annotated relations. Here, we develop a theory of semijoins of annotated relations. To this effect, we first introduce the notion of a semijoin function on a monoid and then characterize the positive commutative monoids for which a semijoin function exists. After this, we introduce the notion of a full reducer for a schema on a monoid and show that the following is true for every positive commutative monoid that has the inner consistency property: a schema is acyclic if and only if it has a full reducer on that monoid.
Read the full abstract

Differential Geometry

Isoparametric hypersurfaces in $\mathbb{S}^{n}\times \mathbb{S}^{m}$ and $\mathbb{S}^{n}\times \mathbb{H}^{m}$

We prove that the angle function associated with the canonical product structure is constant for an isoparametric hypersurface in $\mathbb{S}^{n}\times \mathbb{S}^{m}$, $\mathbb{S}^{n}\times \mathbb{H}^{m}$, or $\mathbb{H}^{n}\times \mathbb{H}^{m}$. This rigidity result enables us to provide a complete classification of isoparametric and homogeneous hypersurfaces in $\mathbb{S}^{n}\times \mathbb{S}^{m}$ and $\mathbb{S}^{n}\times \mathbb{H}^{m}$. Furthermore, we establish a geometric characterization in these two spaces: a hypersurface is isoparametric if and only if it has constant principal curvatures and a constant angle function.
Read the full abstract

Analysis of PDEs

Modulational instability of small amplitude periodic traveling waves in the $b$-family of Novikov equation

We study the modulational instability of smooth, small-amplitude periodic traveling wave solutions to the $b$-family of Novikov equation with cubic nonlinearity with an arbitrary coefficient $b>0$. Our approach is based on applying spectral perturbation theory to the corresponding linearization process. We derive a modulation instability index dependent on the nonlinear parameter $b$ and the fundamental wave number, and prove that when this index is negative, sufficiently small periodic traveling waves in the Novikov equation $b$-family exhibit spectral instability to long-wavelength perturbations. This confirms the well-known Benjamin-Feir instability in the $b$-family of Novikov equation.
Read the full abstract

Combinatorics

Spectral Turán Problems for Expanded hypergraphs

Given a graph $F$, the expansion $F^{(r)}$ of $F$ is defined as the $r$-uniform hypergraph obtained from $F$ by adding a set of $(r-2)$ distinct new vertices to each edge of $F$. In this paper, we investigate spectral stability results for hypergraphs and their applications.We first establish a spectral stability property: for any $r$-uniform hypergraph containing no copy of the expansion $F^{(r)}$ of a $(k+1)$-chromatic graph $F$, if its $p$-spectral is close to the extremal value, then the hypergraph is structurally close to $T_r(n, k)$, the complete $k$-partite $r$-uniform hypergraph on $n$ vertices where sizes of any two parts differ by at most one.Using this spectral stability result, we determine the unique extremal hypergraph that maximizes the $p$-spectral radius among all $n$-vertex $r$-uniform hypergraphs without $t$ vertex-disjoint copies of the expansion $K_{k+1}^{(r)}$ of $K_{k+1}$. We prove that this extremal hypergraph is isomorphic to $K_{t-1}^{r} \,\vee\, T_r(n-t+1, k)$, the join of the complete $r$-uniform hypergraph $K_{t-1}^{r}$ and $T_r(n-t+1, k)$.As a corollary, we show that $K_{t-1}^{r} \,\vee\, T_r(n-t+1, k)$ is the unique extremal hypergraph for $tK_{k+1}^{(r)}$, which extends a result of Pikhurko [J. Combin. Theory Ser. B, 103 (2013) 220–225] for expanded complete graphs.
Read the full abstract

All authors Zhenyu Ni, Dongquan Cheng, Jing Wang, Liying Kang

Numerical Analysis

Inexact versions of several block-splitting preconditioners for indefinite least squares problems

This paper introduces inexact versions of several block-splitting preconditioners for solving the three-by-three block linear systems arising from a special class of indefinite least squares problems. We first establish the convergence conditions for the corresponding stationary iterative methods. Then, it follows that under these conditions, all eigenvalues of the preconditioned matrices are contained within a circle centered at $(1,0)$ with radius $1$. This property implies that these preconditioners are effective in accelerating the convergence of the GMRES method. Furthermore, we analyze the eigenpairs of the preconditioned matrices in detail and derive a theoretical upper bound on the number of GMRES iterations for solving the preconditioned systems. Ultimately, numerical experiments reveal the efficacy of the proposed preconditioners.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Axiomatic Foundation of Quantum-Inspired Distance Metrics

We develop a comprehensive axiomatic framework for quantum-inspired distance metrics on projective Hilbert spaces, providing a unified foundation that organizes and generalizes existing measures in quantum information theory. Starting from five fundamental axioms, projective invariance, unitary covariance, superposition sensitivity, entanglement awareness, and measurement contextuality, we show that any admissible distance depends solely on state overlap and establish the uniqueness of the Fubini-Study metric as the canonical geodesic distance. Our framework further yields a hierarchy of comparison results relating the Fubini-Study metric, Bures distance, Euclidean distance, measurement-based pseudometrics, and entanglement-sensitive distances. Key contributions include an entanglement-geometry complementarity principle, high-dimensional concentration bounds, and operational interpretations connecting distances to state discrimination and quantum metrology. This work places the geometry of quantum state spaces on a rigorous axiomatic footing, bridging abstract metric theory, information geometry, and operational quantum principles.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Genuine certifiable randomness from a black-box

Randomness is intrinsic to quantum mechanics; the outcome of a measurement on a quantum state is a random variable. This feature has been applied to randomness certification, where one party must decide whether the data they receive is truly random. However, existing demonstrations are not black-box, to avoid falsely certifying deterministic data, assumptions must be made on how the data was generated. Here we demonstrate genuine randomness certification in the black-box setting – one in which no deterministic adversary, even with unlimited computational power, will succeed in getting their data certified. We use it to provably generate random numbers using only measurements on single particle states and without a random seed.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Hereditary Geometric Meta-RL: Nonlocal Generalization via Task Symmetries

Meta-Reinforcement Learning (Meta-RL) commonly generalizes via smoothness in the task encoding. While this enables local generalization around each training task, it requires dense coverage of the task space and leaves richer task space structure untapped. In response, we develop a geometric perspective that endows the task space with a "hereditary geometry" induced by the inherent symmetries of the underlying system. Concretely, the agent reuses a policy learned at the train time by transforming states and actions through actions of a Lie group. This converts Meta-RL into symmetry discovery rather than smooth extrapolation, enabling the agent to generalize to wider regions of the task space. We show that when the task space is inherited from the symmetries of the underlying system, the task space embeds into a subgroup of those symmetries whose actions are linearizable, connected, and compact–properties that enable efficient learning and inference at the test time. To learn these structures, we develop a differential symmetry discovery method. This collapses functional invariance constraints and thereby improves numerical stability and sample efficiency over functional approaches. Empirically, on a two-dimensional navigation task, our method efficiently recovers the ground-truth symmetry and generalizes across the entire task space, while a common baseline generalizes only near training tasks.
Read the full abstract

Mathematical Physics

Hankel Determinant for a Perturbed Laguerre Weight with Pole Singularities and Generalized Painlevé III' Equation

We study the Hankel determinant for the weight $x^{\alpha}{\rm exp}(-x-t_1/x-t_2/x^2), x\in[0,+\infty)$, with $\alpha>-1,~t_1\in\mathbb{R}\setminus\{0\}, ~t_2>0.$ Compared with the weight $x^{\alpha}{\rm e}^{-x-t_1/x}$ studied in prior work (where $\alpha,t_1>0$), the range of $\alpha$ in our work is extended and the parameter $t_2$ introduces a “stronger" zero at the origin. This leads to more varied behavior of the Hankel determinant, and the interplay between $t_1$ and $t_2$ introduces uncertainty and complexity into the analysis. By using a pair of ladder operators satisfied by the associated monic orthogonal polynomials and three compatibility conditions, we show that the recurrence coefficients are expressed in terms of four auxiliary quantities which satisfy a system of difference equations that can be iterated. We also establish two coupled second order partial differential equations (PDEs) satisfied by two of the auxiliary quantities, which are reduced to a Painlevé III$^\prime$ equation when $t_2\rightarrow0^+$. Moreover, the logarithmic derivative of the Hankel determinant is shown to satisfy a second order six degree PDE which is reduced to the $\sigma$-form of the Painlevé III$^{\prime}$ equation when $t_2\rightarrow0^+$. Under suitable double scaling, we obtain the limiting forms of the above PDEs and deduce the equilibrium density of the eigenvalues for the unitary ensemble. We extend our analysis to the Hankel determinant for $x^{\alpha}\exp(-x-\sum_{k=1}^m t_k/x^k)$ with $m=3$. For general $m$, we outline a derivation that leads, at least in principle, to the PDE satisfied by the logarithmic derivative of the Hankel determinant.
Read the full abstract

Probability

Markov Modulated JSQ in Heavy Traffic Via the Poisson Equation

In parallel-server systems with a single stream of arrivals (a.k.a. load balancing), Join-the-Shortest-Queue (JSQ) is a popular routing algorithm. There is extensive literature studying this system in various asymptotic regimes, but all assume constant parameters (arrival and service rates). We study the JSQ system with Markov-modulated parameters and heterogeneous servers. Our main contributions are: (i) We compute the heavy-traffic distribution of the scaled vector of queue lengths; (ii) We utilize a novel hybrid methodology that combines the Transform Method for queue-lengths analysis and the Poisson equation; (iii) We provide sufficient conditions to ensure state space collapse, showing provable balancing power of JSQ for heterogeneous servers. Unlike other studies involving Markov-modulated queues, these conditions don't depend on the mixing time of the modulating chain and are valid for a countably infinite state space. We numerically demonstrate the strength of our results under moderate traffic intensities and showcase their independence from the corresponding mixing times.
Read the full abstract

Algebraic Geometry

Canonical blow-ups of Lagrangian and Orthogonal Grassmannians

Let $\mathbf{LG}(V\oplus V^*)$ and $\mathbf{OG}^+(V\oplus V^*)$ denote the Lagrangian and orthogonal Grassmannians endowed with the natural $\mathbb{G}_m$-actions, respectively. Thaddeus proved that over $\mathbb{C}$, the Hilbert quotients $\mathbf{LG}(V\oplus V^*)\!/\!/\mathbb{G}_m$ and $\mathbf{OG}^+(V\oplus V^*)\!/\!/\mathbb{G}_m$ are isomorphic to the wonderful compactifications of the spaces of symmetric and skew-symmetric matrices of maximal ranks, that is, the spaces of complete quadrics and complete skew-forms, respectively. In this paper, we construct the universal families of these Hilbert quotients by explicitly blowing up the corresponding isotropic Grassmannians, resulting in smooth toroidal compactifications of the spaces of symmetric and skew-symmetric matrices of maximal ranks (before projectivization), which have simple normal crossing boundary divisors and include the spaces of the complete bilinear forms among these divisors. Specifically, we prove that over any algebraically closed field, the universal families of these Hilbert quotients are smooth, and the Hilbert quotients themselves are isomorphic to the spaces of the complete bilinear forms. Over an algebraically closed field of characteristic zero, we prove that the universal families are weak Fano varieties with vanishing higher cohomology groups for their tangent bundles, and are therefore locally rigid. Furthermore, we show that these universal families naturally resolve the Landsberg-Manivel rational maps from projective spaces to isotropic Grassmannians.
Read the full abstract

Friday 27 February

Optimization and Control

The Coercive Projection Theorem for Canonical Reciprocal Costs

We develop a finite-data framework for certifying zero-defect (neutral) configurations of positive vectors under the canonical separable reciprocal cost. We show that this scalar cost is characterized among non-constant continuous costs by the Recognition Composition Law together with a local quadratic calibration at balance; in particular, reciprocity symmetry and the normalization at the neutral point follow from the composition law. Under a conservation constraint and short-window observations of a rational (finite–state) signal class, we construct a canonical decision procedure that is locally maximal on the identifiability locus among all sound procedures: any sound rule that resolves a datum must agree with the canonical output, and cannot resolve strictly more cases. The method is organized as $\Phi^\ast=A\circ B\circ P$: the projection/coercivity core is forced by the canonical-cost axioms, while the aggregation/reconstruction step is specified on a non-degenerate identifiability locus (e.g.\ a Hankel invertibility condition).
Read the full abstract

Optimization and Control

Multiparametric continuous-time optimal control via Pontryagin's Maximum Principle: explicit solutions and comparisons with discrete-time formulations

Model predictive control offers a powerful framework for managing constrained systems, but its repeated online optimization can become computationally prohibitive. Multiparametric programming addresses this challenge by precomputing optimal solutions offline, enabling real-time control through simple function evaluation. While extensively developed for discrete-time systems, this approach suffers from combinatorial growth in solution complexity as discretization is refined. This paper presents a systematic continuous-time multiparametric framework for linear-quadratic optimal control that directly solves Pontryagin's optimality conditions without discretization artifacts. Through two illustrative examples, we demonstrate that continuous-time formulations yield solutions with substantially fewer critical regions than their discrete-time counterparts. Beyond this reduction in partition complexity, the continuous-time approach provides deeper insight into system dynamics by explicitly identifying switching times and eliminating discretization artifacts that obscure the true structure of optimal control policies. Knowledge of the switching structure also accelerates online optimization methods by providing analytical information about the solution topology. Clear step-by-step algorithms are provided for identifying switching structures, computing parametric switching times, and constructing critical regions, making the continuous-time framework accessible for practical implementation.
Read the full abstract

Mathematical Physics · Cross-listed from physics.hist-ph

The Birth of Quantum Mechanics and the Dirac Equation

The year 2025 marked the centennial of quantum mechanics, inaugurated by Heisenberg's matrix formulation and the foundational contributions of Pauli, Schrodinger, and Dirac. Concurrently, 2026 marks the centennial of the Klein - Gordon equation, the second-order relativistic wave equation from which both the Schrodinger and Dirac equations were derived. This article supplements the recent review published in J.Phys. A: Math.Theor.,58 (2025) 053001 by providing a more detailed examination of the formative period 1925 - 1928, with particular attention to contributions that have received insufficient recognition in the standard narrative. We reconstruct Kramers' independent derivation of the Dirac equation - obtained essentially simultaneously with Dirac's own result yet unpublished for seven years - and discuss its relation to Van der Waerden's group-theoretical approach. The role of Charles Galton Darwin in elucidating the physical content of the Dirac equation is also highlighted. In addition, we present two modern derivations not catalogued in the earlier review: one based on Operational Dynamical Modeling, which deduces the Dirac equation from relativistic Ehrenfest relations and the canonical commutation algebra, and one rooted in the Madelung hydrodynamic formulation. Three broad periods of quantum theory development – foundational, consolidation, and the modern era of quantum information – are briefly surveyed.
Read the full abstract

Numerical Analysis · Cross-listed from cs.NE

Robust Parameter and State Estimation in Multiscale Neuronal Systems Using Physics-Informed Neural Networks

Inferring biophysical parameters and hidden state variables from partial and noisy observations is a fundamental challenge in computational neuroscience. This problem is particularly difficult for fast - slow spiking and bursting models, where strong nonlinearities, multiscale dynamics, and limited observational data often lead to severe sensitivity to initial parameter guesses and convergence failure in the methods replying on the traditional numerical forward solvers. In this work, we developed a physics-informed neural network (PINN) framework for the joint reconstruction of unobserved state variables and the estimation of unknown biophysical parameters in neuronal models. We demonstrate the effectiveness of the method on biophysical neuron models, including the Morris-Lecar model across multiple spiking and bursting regimes and a respiratory model neuron. The method requires only partial voltage observations over short observation windows and remains robust even when initialized with non-informative parameter guesses. These results suggest that PINN can deliver robust and accurate parameter inference and state reconstruction, providing a promising alternative for inverse problems in multiscale neuronal dynamics, where traditional techniques often struggle.
Read the full abstract

General Mathematics

Direct Product of Picture Fuzzy Subgroups

In this paper, the concept of a picture fuzzy subgroup of a group is studied, and the notion of the direct product of picture fuzzy subgroups is introduced. Several characterisations of the direct product of picture fuzzy subgroups are established using the $(r, s, t)$-cut sets of picture fuzzy sets.
Read the full abstract

Numerical Analysis · Cross-listed from physics.geo-ph

A divide-and-conquer strategy for fast elastodynamic simulation of earthquakes and aseismic slip on fault networks

Simulating long-term, fully dynamic sequences of earthquakes and aseismic slip (SEAS) on geometrically complex fault networks remains computationally demanding due to the cost of resolving elastodynamic interactions. Although high-performance computing improves feasibility, simulations remain expensive, particularly for multicycle evolution, motivating the widespread use of quasi-dynamic approximations based on radiation damping. Here we present an efficient numerical framework for fully elastodynamic SEAS simulations on complex fault networks. The method adopts a divide-and-conquer strategy in which elastodynamic self-effects and fault-to-fault interactions are treated separately using boundary integral formulations tailored to each interaction type. Self-interactions along planar faults are computed using a non-replicating spectral boundary integral formulation that eliminates periodic-image artifacts, while interactions between arbitrarily oriented faults are evaluated through a fully dynamic space-time boundary integral representation accelerated by hierarchical matrices (H-matrices). A key advance is a selective H-matrix compression strategy based on fault-wise assembly of independent binary trees, enabling low-rank approximation of long-range interactions while preserving near-field accuracy and excluding self-effects from the hierarchical structure. Additional efficiency arises from physics-informed truncation of elastodynamic histories using mode-dependent time windows and causality-based kernel truncation. Benchmark multi-fault simulations validate accuracy against reference uncompressed solutions. The method reduces interaction complexity from O(N^3) to O(N^2 log N), yielding up to three orders of magnitude speedup and an order-of-magnitude memory reduction for typical problem sizes (~3e10 degrees of freedom), enabling fully dynamic SEAS simulations on workstation hardware.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Vector Certificates for $\omega$-regular Specifications

The recently introduced notions of ranking functions and closure certificates utilize well-foundedness arguments to facilitate the verification of dynamical systems against $\omega$-regular properties. A ranking function and a closure certificate are real-valued functions defined over states and state pairs of a dynamical system whose zero superlevel sets are inductive state invariant and inductive transition invariant, respectively. The search for such certificates can be automated by fixing a specific template class, such as a polynomial of a fixed degree, and then using optimization techniques such as sum-of-squares (SOS) programming to find it. Unfortunately, such certificates may not be found for a fixed template. In such a case, one must change the template; for example, increase the degree of the polynomial. In this paper, we consider a notion of multiple functions in the form of vector certificates. Taking inspiration from the literature on vector barrier certificates as generalizations of standard barrier certificates for safety verification, we propose vector co-Büchi ranking functions and vector closure certificates as nontrivial generalizations of ranking functions and closure certificates, respectively. Both notions consist of a set of functions that jointly overapproximate an inductive invariant by considering each function to be a linear combination of the others. The advantage of such certificates is that they allow us to prove properties even when a single function for a fixed template cannot be found using standard approaches. We present an SOS programming approach to search for these functions and demonstrate the effectiveness of our proposed method in verifying $\omega$-regular specifications in several case studies.
Read the full abstract

Optimization and Control

Sparse optimal control in the Wasserstein space

We study sparse optimal control of a non-local continuity equation, where the goal is to steer a distribution via finitely many controllable agents or actuators. This model arises naturally in mean-field multi-agent systems and takes the form of a coupled PDE-ODE system where the PDE describes the evolution of the distribution and the controlled ODE captures the dynamics of the controllable agents. A natural objective is distribution steering via terminal costs based on optimal transport, such as the squared Wasserstein distance. These costs are problematic for finite-agent formulations due to non-smoothness at empirical measures and they fall outside common expected-value-type cost classes. We address these challenges by studying the resulting optimal control problem in the Wasserstein space. Under suitable assumptions on the system dynamics and Wasserstein differentiability of the terminal cost (with no smoothness requirement on the associated Wasserstein gradient), we prove first-order sensitivity of the control-to-state map, derive an adjoint system and an explicit formula for the gradient of the cost functional, and obtain Pontryagin-type necessary conditions. To illustrate the resulting adjoint-based method, we present numerical experiments on a representative distribution-splitting task.
Read the full abstract

Functional Analysis

The heat kernel on a complex semisimple Lie group and an integral presentation of the heat kernel on its split real form

Let $G$ be a connected semisimple Lie group, and $G_0$ be its connected split real form. In this paper, we deduce explicit expressions for the heat kernels $\rho^{G_0}_t$ associated with the Laplace–Beltrami operators $\Delta_{G_0}$ and $\Delta_{G}$ respectively, using the algebra of differential operators on an appropriate homogeneous space. These expressions involve the heat Gaussian and the heat kernel on a maximal compact subgroup. Using these expressions for $\rho^{G_0}_t$ and $\rho^{G}_t$, we derive an integral formula relating the heat kernel $\rho^{G_0}_t$ to $\rho^{G}_t$. In the special case of $G_0=SL(2,\mathbb{R})$, we show that the integral formula of $\rho^{SL(2,\mathbb{R})}$ is expressed in terms of the properties of Tchebycheff polynomials.
Read the full abstract

Algebraic Geometry

Specializations of symplectic and van Geemen–Sarti involutions on K3 surfaces

Given a symplectic involution $\iota$ on a K3 surface $X$, the desingularization $Y$ of $X/\iota$ is still a K3 surface, which in general has a different Néron–Severi group. Nevertheless, if the involution is induced by the translation by a 2-torsion section on an elliptic fibration (i.e. it is a van Geemen–Sarti involution) and the Picard number is minimal, the Néron–Severi groups of $X$ and $Y$ are known to be isometric. We first determine infinitely many codimension 2 subfamilies of projective K3 surfaces with a symplectic involution (not of van Geemen–Sarti type) whose generic members satisfy $NS(X)\simeq NS(Y)$. Then, we describe the cohomological action of a van Geemen–Sarti involution and we characterize specializations of K3 surfaces with a van Geemen–Sarti involution for which it is still true that $NS(X)\simeq NS(Y)$. There is a 5-dimensional family of K3 surfaces with van Geemen–Sarti involution for which $X\simeq Y$. The K3 surfaces in such a family admit complex multiplication, and we describe its cohomological action. We briefly discuss similar problems for order 3 symplectic automorphisms induced by a translation by a 3-torsion section on an elliptic fibration.
Read the full abstract

Numerical Analysis

Integral equations for flexural scattering problems with periodic boundaries

We develop a method for computing the scattering of flexural waves off of a periodic wall or a periodic line of scatterers. These waves model the fluctuations of thin plates with periodic clamped, supported, or free edges. We use the Floquet-Bloch transform to convert the problem into a collection of uncoupled quasi-periodic problems. We then solve each quasi-periodic problem efficiently and accurately using a novel integral equation based on the quasi-periodic flexural Green's function. Finally, we show how the proposed method can be used to simulate scattering from junctions of semi-infinite lines of scatterers.
Read the full abstract

All authors Fruzsina Agocs, Tristan Goodwill, Jeremy G. Hoskins, Peter Nekrasov

Numerical Analysis

KROM: Kernelized Reduced Order Modeling

We propose KROM, a kernel-based reduced-order framework for fast solution of nonlinear partial differential equations. KROM formulates PDE solution as a minimum-norm (Gaussian-process) recovery problem in an RKHS, and accelerates the resulting kernel solves by sparsifying the precision matrix via sparse Cholesky factorization. A central ingredient is an empirical kernel constructed from a snapshot library of PDE solutions (generated under varying forcings, initial data, boundary data, or parameters). This snapshot-driven kernel adapts to problem-specific structure – boundary behavior, oscillations, nonsmooth features, linear constraints, conservation and dissipation laws – thereby reducing the dependence on hand-tuned stationary kernels. The resulting method yields an implicit reduced model: after sparsification, only a localized subset of effective degrees of freedom is used online. We report numerical results for semilinear elliptic equations, discontinuous-coefficient Darcy flow, viscous Burgers, Allen–Cahn, and two-dimensional Navier–Stokes, showing that empirical kernels can match or outperform Matérn baselines, especially in nonsmooth regimes. We also provide error bounds that separate discretization effects, snapshot-space approximation error, and sparse-Cholesky approximation error.
Read the full abstract