Mathematical Physics
From Bopp Shifts to Toroidal Shadows: K-Theoretic Gap Labels in Noncommutative Quantum Mechanics
S. Hasibul Hassan Chowdhury
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
Yiwei Qiu, Jiahao Hu, Yi Zhou et al. (+4 more)
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
Zhang-nan Hu, Bing Li and YiJing Wang
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
Xianchao Xiu, Shenghao Sun, Xinrong Li et al. (+1 more)
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
Feibo Jiang, Siwei Tu, Li Dong et al. (+5 more)
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
Jiacheng Wang, Yucheng Sheng, Le Liang et al. (+2 more)
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
Najeeb Khan
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
Phokion G. Kolaitis
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}$
Huixin Tan, Yuquan Xie and Wenjiao Yan
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
Xin Zhao, Lin Lu and Aiyong Chen
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
Zhenyu Ni, Dongquan Cheng, Jing Wang et al. (+1 more)
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
Mohaddese Kaveh Shaldehi and Davod Khojasteh Salkuyeh
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
Maryam Bagherian
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
Liam P. McGuinness
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
Paul Nitschke and Shahriar Talebi
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
Shulin Lyu and Yuanfei Lyu
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
Daniela Hurtado-Lange and Izzy Grosof
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
Hanlong Fang, Alex Massarenti and Xian Wu
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 ▾