Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 8 May

Analysis of PDEs

Global Existence of Classical Solutions to Brenner-Navier-Stokes-Fourier System for Large Data

We study the 1D Brenner-Navier-Stokes-Fourier (BNSF) system, proposed as a refinement of the classical Navier–Stokes–Fourier model through the introduction of the volume velocity, distinct from the mass velocity describing convective transport. When formulated in the Lagrangian mass coordinates with the volume velocity, the discrepancy between the two velocities induces a dissipative structure in the mass conservation law. We prove the global existence of classical solutions for arbitrarily large initial data. More precisely, for initial data in $H^k(\mathbb{R})$ with $k\ge3$, with the specific volume and absolute temperature initially bounded away from zero, we construct global-in-time solutions that remain in the same regularity class. Our result accommodates arbitrarily large initial data. A major difficulty is to establish lower and upper bounds for the specific volume \(v\). The additional dissipation yields an $L_t^2 L_x^2$ bound for $v_x$, which is further improved to an $L_t^\infty L_x^\infty$ bound of $v$ and $1/v$ via the parabolic De Giorgi method. We also apply the maximum principle to obtain a positive lower bound for the absolute temperature.
Read the full abstract

Numerical Analysis

Convergence of an Eulerian scheme for the Vlasov-Poisson-BGK model

The Vlasov-Poisson-BGK (VPBGK) model is a kinetic model for describing the dynamics of collisional plasmas. Although various numerical schemes have been developed for it, a corresponding convergence theory has been absent. This paper fills this gap by presenting the first convergence analysis for a non-splitting, finite-difference Eulerian scheme discretized on the full phase-space grid. A major theoretical obstacle is the mixing of velocity indices induced by the electric field, which hinders the derivation of a uniform lower bound for the discrete solution. To overcome this stability challenge, we propose a modified lower bound estimate suitable for ionized systems that incorporates the step-wise degradation. Under a truncated velocity domain with a Neumann boundary condition, we establish error estimates for the distribution function in a weighted $L^{\infty}$ norm and for the electric field in a $L^{\infty}$ norm, respectively.
Read the full abstract

Probability

A Scaling Limit of Random Walks in the Rational Adeles

This paper shows the convergence of adele-valued random walks to an adelic Lévy process under scaling limits. We use random walks on the $p$-adic numbers to construct random walks initially on the infinite product space, and use survival time analysis to prove that the random walks are almost surely adelic for all time. The adelic random walks are shown to be small perturbations of processes that are supported on a finite product of path spaces. Weak convergence to an adelic Lévy process is established in the $J_1$ Skorokhod topology.
Read the full abstract

Combinatorics

New results on the odd- and unique-Ramsey numbers

The odd-Ramsey number $r_{\text{odd}}(n,H)$ of a graph $H$ is the minimum number of colors needed to edge-color $K_n$ so that in every copy of $H$ some color occurs an odd number of times, and the unique-Ramsey number $r_{\text{u}}(n,H)$ is the corresponding notion in which some color is required to occur not only an odd number of times but exactly once. In this paper, we address three questions from previous papers. We show $r_{\text{odd}}(n,K_{s,t})> n^{1/\left(\frac s2+\frac 1{2\lfloor t/8 \rfloor}\right)}$ when $s\leq t$ and $s$ is odd and $t$ is even, which is log-asymptotically tight when $s$ is fixed and $t\to\infty$. Next, we consider the odd-Ramsey number when the host graph to be edge-colored is a super-Dirac graph, and show that the smallest minimum degree that forces a non-trivial odd-Ramsey number of Hamilton cycles is $n/2+1$. Finally, we show that $r_\text{u}(n,C_n)> n/4$, which leads to a polynomial gap between $r_\text{odd}(n,C_n)$ and $r_\text{u}(n,C_n)$.
Read the full abstract

Numerical Analysis · Cross-listed from cs.AR

TREA: Low-precision Time-Multiplexed, Resource-Efficient Edge Accelerator for Object Detection and Classification

This work presents TREA, a low-precision time-multiplexed and resource-efficient edge-AI accelerator for object detection and classification, targeting stringent area-power-latency constraints of edge vision platforms. The proposed architecture integrates a dual-precision (4/8-bit) SIMD multiply-accumulate (DQ-MAC) unit based on most-significant-digit-first (MSDF) shift-and-add computation with run-time bit truncation, eliminating conventional multiplier overhead and reducing accumulator bit-width. The DQ-MAC supports 4x FxP4 or 1x FxP8 operations per cycle, achieving up to 4x throughput improvement without hardware duplication. A structured hardware-aware reductive pruning (SHARP) strategy is co-designed with the SIMD datapath, enabling near 50% structured sparsity while maintaining full MAC utilization. This allows a 3x3 convolution kernel to be computed in 1 cycle in FxP4 mode compared to 9 cycles in FxP8, and a 5x5 kernel in 3 cycles versus 25 cycles, yielding up to 9x latency reduction at the kernel level. The accelerator further incorporates a reconfigurable CORDIC-based nonlinear activation function (RQ-NAF) core with a 9-stage pipeline, supporting Sigmoid, Tanh, and ReLU at one output per cycle after pipeline fill, while enabling (N-1) hardware reuse through time-multiplexing. The complete TREA architecture employs a 1D array of 100 SIMD DQ-MAC units with layer-wise hardware reuse, significantly reducing area and control complexity. Experimental results demonstrate substantial improvements in latency, hardware utilization, and energy efficiency compared to conventional fixed-precision and non-reconfigurable accelerators, validating TREA as an effective solution for real-time edge vision workloads.
Read the full abstract

All authors Vijay Pratap Sharma, Mukul Lokhande, Ratko Pilipovic, Omkar Kokane, Santosh Kumar Vishvakarma

Analysis of PDEs

Lifespan estimate for one dimensional wave equation with semilinear terms of spatial derivative

This paper studies the upper and lower bounds of the lifespan for the classical solutions to the initial value problems of one dimensional wave equations with non-autonomous semilinear terms including the space-derivative of the unknown function.This is a non-trivial business comparing to the analogous results with time-derivative type semilinear terms, especially for the proof to obtain the sharp upper bound of the lifespan as we have to deal with space dependent weights among iteration procedures of the weighted functional of the solution. Also it is surprising that a part of them reaches to the same ordinary differential inequality for classical semilinear damped wave equations introduced by Li and Zhou (Discrete Contin. Dynam. Systems, 1995, 1(4): 503-520), and we show a simple proof for blow up result from this ordinary differential inequality by iteration argument and slicing method in more general situation.
Read the full abstract

All authors Ning-An Lai, Cui Ren, Takiko Sasaki, Hiroyuki Takamura

Combinatorics

On the Number of Zero Forcing Minimal Forts on Trees

We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where $\mathcal{F}_{T_n}$ is the maximum number of minimal forts on a tree on $n$ vertices and $\mathcal{F}_{P_n}$ is the number of minimal forts of the path graph on $n$ vertices. Our solution relies on both a computational and theoretical approach. Computationally, we introduce and implement an efficient algorithm to compute the exact number of minimal forts for small trees; this is used to establish the large base case required for our strong induction. Theoretically, we provide an adaptation of the recursion relation that defines $\mathcal{F}_{P_n}$ that applies for all forests; this is used in the induction step to establish the result.
Read the full abstract

Optimization and Control · Cross-listed from cs.RO

Variable Aerodynamic Damping Actuation via Co-Contraction: A Structural Analogy with Variable Stiffness Actuation

This work identifies a passive aerodynamic damping effect induced by co-contraction in antagonistic redundant propulsion. Complementing prior work on aerodynamic promptness, which addressed active wrench-rate authority along constant-wrench fibers, we study the passive side: the local derivative of aerodynamic force with respect to air-relative velocity at a trim. This derivative defines an incremental aerodynamic damping coefficient. We prove that it increases monotonically along constant-force fibers under a mild aerodynamic hardening condition, and derive this property from a first-order Blade Element Theory model exposing the relevant speed-inflow coupling. The resulting mechanism, Variable Aerodynamic Damping Actuation (VADA), is formulated as an antagonistic aerodynamic actuation module and allocation principle, structurally analogous to variable-stiffness actuation at the level of fiber motions and incremental impedance modulation. An impedance-form interpretation clarifies common- and differential-mode roles, while a propeller-data-based assessment using the UIUC Propeller Database shows that the identified damping has practical small-UAV magnitude, is comparable to ordinary low-speed body-drag damping, and depends strongly on low-advance-ratio thrust sensitivity.
Read the full abstract

Analysis of PDEs

A revisit via slicing method on a quadratic semilinear wave equation in two space dimensions

In this paper, we are focusing on the proof of the blow-up result for a quadratic semilinear wave equation in two space dimensions. There is a logarithmic loss in estimating the lifespan of classical solutions if the 0th moment of the initial speed does not vanish. This result is already known with almost sharp constants. But in order to have a direct application to numerical analysis, we show a simple proof by iteration argument of point-wise estimate of the solution with the slicing technique.
Read the full abstract

Numerical Analysis

Sparse Random-Feature Neural Networks with Krylov-Based SVD for Singularly Perturbed ODE

Random-feature neural networks (RFNNs), including architectures with fixed hidden layers and analytically determined output weights, offer fast training but often suffer from issues due to dense representations of the hidden layer activation. Their reliance on dense feature mappings and least squares solvers can limit scalability and numerical stability, particularly for high-dimensional or stiff systems. Specifically, the activation matrix is observed to be low-rank and extremely ill-conditioned. In this work, we propose a sparse framework for RFNNs that integrates structured sparsity into the hidden layer activations that increases the rank and employs Sparse Singular Value Decomposition (sSVD) for solving the resulting linear least squares problem scalably and efficiently while catering to the bad condition number. We explore the theory behind Lanczos-Golub-Kahan Bidiagonalization technique for sparse SVD and conduct some experiments to identify some limitations and justify the requirement for orthogonalization step in our application. Then, we demonstrate that the proposed method maintains or improves solution accuracy for solving the benchmark one-dimensional steady convection-diffusion equations case having stronger advection, while achieving substantial gains in training efficiency and robustness compared to standard dense implementations.
Read the full abstract

Analysis of PDEs

Dirichlet problem for Lane-Emden type equations with several sublinear terms

We prove the existence, uniqueness, and sharp bilateral pointwise estimates for positive bounded solutions to the Lane–Emden type problem \[ \begin{cases} L u = \sum\limits_{i=1}^{m}\sigma_{i} u^{q_{i}}+\sigma_0, \quad u\geq0 & \text{in } \Omega, \liminf \limits_{x \rightarrow y} u(x) = f(y), & y \in \partial^\infty\Omega, \end{cases} \] where $0 < q_{i} < 1$. Here $Lu = - \text{div}(A \nabla u)$ is a uniformly elliptic operator with bounded coefficients, $\sigma_{i}$ is a nonnegative locally finite Borel measure on an $A$-regular domain $\Omega \subset \mathbb{R}^n$ which possesses a positive Green function associated with $L$, and $f$ is a nonnegative continuous function on the boundary $\partial^\infty\Omega$. An analogous result for positive continuous solutions to the problem is also illustrated. Our method can be adapted to address related sublinear problems with zero boundary conditions involving the fractional Laplace operator $(-\Delta)^{\alpha}$ for $0< \alpha < n/2$, in place of $L$, in $\mathbb{R}^n$ as well.
Read the full abstract

Probability

Small noise asymptotic behaviors for path-dependent multivalued McKean-Vlasov stochastic differential equations

This paper investigates the asymptotic behavior of path-dependent multivalued McKean-Vlasov stochastic differential equations perturbed by small noise. Specifically, we first establish a large deviation principle for such equations under non-Lipschitz coefficients by the weak convergence approach. Subsequently, we introduce an auxiliary equation and apply it to derive the moderate deviation principle. Finally, we construct another auxiliary equation and a limit equation, and prove the central limit theorem.
Read the full abstract

Information Theory

How Big Should a Wireless Foundation Model Be?

Wireless foundation models are rapidly emerging as a key enabler of AI-native communication systems, yet a fundamental question remains unanswered: how large should these models be? We present a principled, physics-grounded answer, showing that the intrinsic dimensionality (dNL, the nonlinear manifold dimension of the channel) acts as the fundamental bottleneck, defining the scaling ceiling once a data-sufficient regime is reached. This dimensionality is not a design choice but a physical constraint: Maxwell's equations, finite scatterers, and antenna aperture inherently constrain wireless propagation environments to a limited number of degrees of freedom – spanning 5-35 across both real-world OTA measurements and 3GPP-standardized channel models we evaluate – orders of magnitude below the ~1,000-dimensional semantic space of language. As a consequence, we propose a scaling framework for wireless AI: taking NTN satellite channels as a representative case (dNL ~= 14), scaling gains diminish rapidly beyond ~30 million parameters, entering a stochastic asymptote above 70M where a further 1.6x increase (96M->150M) yields only 0.52 dB. Beyond this ceiling, inference-time adaptation via pilot-aided test-time training (TTT) is far more effective: a compact 12M-parameter model surpasses a static 96M model by 9.9 dB (NMSE, SNR = 20 dB) / 7.6 dB (MCM, SNR = 10 dB) at one-eighth the parameters. With dNL distributions validated across real-world indoor massive MIMO measurements, our scaling laws and TTT gains are demonstrated through NTN satellite simulations, reframing wireless AI design: channel geometry – not model size – fundamentally governs the scaling laws of physical-layer wireless AI.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

EPTAS for Hard Graph Cut Problems for Dense Graphs

Everywhere-$\delta$-dense graphs are defined as graphs on $n$ vertices in which every vertex has degree at least $\delta n$ for some constant $\delta > 0$. Approximation schemes are vital for handling NP-hard optimization problems, but for many graph cut problems, existing PTAS algorithms often suffer from running times of $n^{f(1/\varepsilon)}$. In this paper, we bring PTASs down to EPTASs for several fundamental minimization problems on everywhere-$\Omega(1)$-dense graphs. Specifically, we present the first Efficient Polynomial-Time Approximation Scheme (EPTAS), running in time $f(1/\varepsilon)n^{O(1)}$, for the ConstrainedMinCut problem under a global constraint on vertex weights, a problem that captures BalancedSeparator and SmallSetExpansion. Moreover, we give the first EPTASs for MinQuotientCut and ProductSparsestCut on everywhere-$\delta$-dense graphs with integer-valued dense vertex weights; these problems generalize the four well-known problems UniformSparsestCut, EdgeExpansion, Conductance, and NormalizedCut. Our main technical contribution is an EPTAS for ConstrainedMinCut, based on the weak regularity lemma and sampling and estimation techniques. We then obtain EPTASs for MinQuotientCut and ProductSparsestCut via a unified reduction that invokes this algorithm as a subroutine. In contrast, previous works giving PTASs for these problems on everywhere-$\delta$-dense graphs typically rely on powerful tools such as the Lasserre hierarchy or specific integer programming technique, which we avoid.
Read the full abstract

Information Theory

Movable Subarray-Aided Hybrid Beamforming for Near-Field Multiuser Communications

Movable antenna (MA)-enabled near-field (NF) communications offer significant potential for 6G, yet existing designs often neglect the practical constraints of hybrid beamforming (HBF) for extremely large-scale MIMO (XL-MIMO). Conversely, MA-aided HBF frequently overlooks the rich NF degrees of freedom (DoFs). This paper proposes a movable subarray (MSA)-aided HBF architecture for NF multiuser systems, which strikes a strategic balance between hardware practicality and spatial flexibility. By coupling MSA movement with HBF, the proposed design simultaneously exploits NF distance-dependent and MSA position-dependent DoFs, enabling highly precise beamfocusing and superior interference mitigation. To alleviate the computational burden, a hybrid planar-spherical wave model is introduced for efficient channel approximation. Furthermore, an alternating optimization (AO) algorithm is developed by integrating fractional programming, the alternating direction method of multipliers (ADMM), and projected gradient ascent. Simulation results validate substantial sum-rate gains over fixedposition antenna (FPA) benchmarks.
Read the full abstract

Numerical Analysis

Variable decoupling and the Kolmogorov Superposition Theorem for rational functions

The goal of this paper is to show that for rational multivariate functions, the Kolmogorov Superposition Theorem (KST) involves several univariate functions, which can be written down by inspection. In other words, no computation is required for decoupling the variables of multivariate rational functions. The key tool for this development is the Loewner Framework for multivariate functions. Applications of this result involve the approximation of multivariate non-rational functions by low-complexity multivariate rational and polynomial functions.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Sample Complexity of Stochastic Optimization with Integer Variables

We establish sample complexity results for stochastic optimization over the integers, especially with a view to understand the complexity with respect to the corresponding continuous optimization problem. We show that integer optimization can sometimes require strictly more samples and sometimes strictly smaller number of samples, depending on the structure of the objective and constraints. 1. For Lipschitz objectives over subsets of the $\ell_\infty$ ball, the statistical complexity of general stochastic mixed-integer, nonlinear, nonconvex optimization is exactly the same as stochastic linear optimization with just bound constraints. 2. For Lipschitz objectives over subsets of the $\ell_2$ ball, we show that integer optimization can require strictly *smaller* sample size compared to the continuous setting in a certain regime. To get to this result, we also establish tight sample complexity results for nonconvex continuous stochastic optimization which, to the best of our knowledge, do not appear in prior work. 3. For strongly convex, smooth objectives, integer optimization has high statistical complexity compared to the continuous setting. In particular, we show that integer optimization requires $\Omega(1/\epsilon^2)$ samples to report an $\epsilon$-approximate solution, compared to the well-known $O(1/\epsilon)$ sample complexity from the continuous optimization literature.
Read the full abstract

All authors Hongyu Cheng, Yinghao Zheng, Marco Molinaro, Amitabh Basu

Functional Analysis

Octonionic isometric isomorphisms and partial isometry

Very recently, two new notions of para-linear mappings and weak associative orthonormal bases were introduced in octonionic functional analysis, which have been proved to be powerful in formulating the basic theory, such as the Riesz representation theorem and the Parseval theorem. In this article, we continue exploring more properties of these two concepts and initiate the study of octonionic para-linear isometric operators. Surprisingly, it is proven that the condition of the para-linear operator on a Hilbert octonionic bimodule being an isometric isomorphism is equivalent to it mapping any associative orthonormal basis to a weak associative orthonormal basis, which implies also that an octonionic matrix is an isometry if and only if the system of its row vectors is a weak associative orthonormal basis. Furthermore, we introduce the concept of para-linear partial isometric operators and establish the aforementioned analogue in this new setting. Based on these facts, we can provide naturally a new viewpoint of James questions by modifying the definition of octonionic Stiefel space.
Read the full abstract

Optimization and Control

Dynamical Systems in Elliptical Pursuit and Evasion

This paper investigates the elliptical case of one-on-one pursuit and evasion problems. Using the simultaneous differential equations derived by Barton and Eliezer, we derive a dynamical system based on the assumption that the shape of the pursuer's trajectory is unaffected by the evader's speed. The dynamical system involves the angular difference between the velocity vectors of the players and their separation distance. We examine whether the pursuer lies inside or outside the evader's elliptical path, and how the angle between the directions of motion of the two players evolves. Moreover, using a complex variable that includes information about the logarithmic distance and the angular difference, we transform the system into a single ordinary differential equation along which the distance between any two solutions never increases. We obtain four main results. First, when the evader is slower than the pursuer, the pursuer captures the evader in finite time, and we derive an explicit upper bound for the capture time. Second, when the evader is faster than the pursuer, a pursuer starting inside the evader's elliptical path is never captured, whereas capture does occur from just outside it on a nearly head-on course. Third, in the same case, the system has a unique periodic solution, to which every solution that avoids capture converges. Fourth, this periodic solution is hyperbolic and exponentially stable, and the product of its Floquet multipliers is given explicitly.
Read the full abstract

2605.07217 · 8 May · v3: major revision. Theorem 3 of v2 (global convergence for n<1) is corrected: the periodic solution attracts every solution that avoids capture, but capture can occur for pursuers starting just outside the ellipse. The proofs are rewritten and extended. Sections 4 and 5 of v2 (simulation results) were published separately as S. Yoshihara, JSIAM Letters 18 (2026) 109-112, and are removed here

Differential Geometry

The classical Weyl law for Schrödinger operators on complete Riemannian manifolds

We establish a criterion for the validity of the classical (non-semiclassical) Weyl law for Schrödinger operators $ H=\Delta+V $ on complete Riemannian manifolds. In contrast to existing results, our approach does not rely on standard geometric assumptions such as bounded geometry, nor on analytic assumptions such as the doubling condition on the potential. Instead, we identify a geometric-analytic invariant that encodes the precise balance between the geometry of the manifold, the growth of $V$, and the oscillation scale of $V$. This intrinsic quantity, denoted $c_{\delta}(\lambda)$ admits effective quantitative estimates. We prove that the Weyl asymptotic holds provided $\lim_{\lambda\to\infty} c_\delta(\lambda)=0 .$ The sharpness of this criterion is demonstrated through explicit examples showing that the Weyl law can fail when the criterion is violated.
Read the full abstract

Dynamical Systems

Minimal speed of unbounded traveling wave solutions for a 1D reaction-diffusion equation and their relationship with the dynamics at infinity

This paper presents results on the unboundedness and minimal speed of traveling wave solutions for a one-dimensional spatial reaction-diffusion equation with an asymptotically linear reaction term and a saturation parameter. By applying a Poincaré-type compactification, we reveal the full dynamics (including infinity) of the two-dimensional system of ordinary differential equations satisfied by traveling wave solutions. This yields essential information characterizing traveling wave solutions: the classification of trajectories in the phase plane, the positivity and unboundedness of front-type and sign-changing profiles, and the explicit form of the minimal speed. This paper examines a special equation with an asymptotically linear reaction term. While, our results differ from those of conventional linear determinacy. We claim that the minimal speed is derived from information at infinity within the traveling wave system.
Read the full abstract

Combinatorics

Counterexamples to a conjecture on graph inertia

The inertia of a graph $G$ is $\operatorname{In}(G)=(n^+(G),n^0(G),n^-(G))$, where $n^+(G),\, n^0(G),\, n^-(G)$ are the numbers of positive, zero and negative eigenvalues of the adjacency matrix of $G$, respectively, counted with multiplicities. Akbari, Elphick, Kumar, Pragada and Tang [Discrete Math. 349 (2026) 114953] conjectured that every graph $G$ satisfies \[ 2n^+(G)\le n^-(G)(n^-(G)+1). \] In this note, we construct a family of reduced graphs $\{W_{k}:\,k\ge5\}$ with \[ \operatorname{In}(W_k) = \left(\binom{k}{2}+1,\ 0,\ k-1\right), \] each of which violates the conjectured inequality. We also observe that deleting the vertex $a_1$ from $W_5$ gives a reduced graph with inertia $(10,0,4)$, answering a question raised in the same paper. The family also refutes a weaker inequality proposed there.
Read the full abstract

Probability

Convergence of Stochastic Gradient Descent with mini-batching and infinite variance

Stochastic gradient descent (SGD) with mini-batching is a standard tool in large-scale optimization, yet its theoretical properties under heavy-tailed gradient noise remain largely unexplored. In this paper we study SGD with increasing batch sizes when the gradient noise belongs to the domain of attraction of an $\alpha$-stable law with $\alpha\in(1,2)$. Building on existing results for the finite-variance regime and for heavy-tailed SGD without batching, we establish three main results. First, we derive $L^p$ moment bounds for the SGD error and show that increasing batch sizes lead to faster convergence rates. In particular, batching enables convergence in probability even for a constant stepsize. Second, we prove that the properly normalized SGD iterates converge in distribution to the stationary law of an Ornstein-Uhlenbeck process driven by an $\alpha$-stable Lévy process. Third, for Polyak-Ruppert averaging we obtain a stable limit theorem with a normalization that explicitly depends on the batch-size schedule.
Read the full abstract

Functional Analysis

Octonionic Riesz-Dunford functional calculus

The Riesz-Dunford functional calculus over the algebra of octonions, denoted by $\mathbb{O}$, has long been an open problem due to the nonassociativity of octonions. Two core obstacles hinder its development: first, the generalization of the resolvent operator series identity produces unexpected associator terms that invalidate standard expansions; second, the nonassociativity spoils the analyticity of the resolvent operator, a key property for defining a functional calculus via Cauchy integrals. In this paper, we initiate the study of the Riesz-Dunford functional calculus for bounded power-associative para-linear operators in Banach octonionic bimodules. To address the above issues, we introduce several pivotal concepts: power-associative operators (to eliminate the unwanted associator terms and recover valid resolvent series expansions), the notions of regular inverse of $R_s-T$ for $s\in \O$ (which serve as the octonionic versions of the resolvent operator), $\mathbb{C}_J$-extendable power-associative operators, and $\mathbb{C}_J$-liftable power-associative operators (to characterize the slice regularity of the resolvent operators). Based on these notions, we define two types of octonionic spectra: the pull-back spectrum $\sigma^*(T)$ and the push-forward spectrum $\sigma_*(T)$. These give rise to the left and right slice regular functional calculi of bounded power-associative para-linear operators, respectively. This theory unifies the Riesz-Dunford functional calculus over division algebras ($ \mathbb{C}, \mathbb{H}, \mathbb{O}$) and fills the six-decade-long gap in octonionic (nonassociative) functional analysis.
Read the full abstract

All authors Qinghai Huo, Guangbin Ren, Irene Sabadini, Zhenghua Xu

Combinatorics

The saturation number of $K^s_t$

For a given graph $F$, a graph $G$ is said to be $F$-saturated if $G$ contains no copy of $F$ but for any edge $uv\notin E(G)$, $G+uv$ contains a copy of $F$. The saturation number $sat(n,F)$ is defined as the minimum number of edges among all $n$-vertex $F$-saturated graphs. The virus graph $K^s_t$, where $s\geq0$ and $t\geq \max\{3,s\}$, is a graph of order $s+t$ constructed by attaching $s$ distinct leaves to $s$ different vertices of a complete graph $K_t$. Hua and Peng [Discrete Math. 349 (2026) 114674] determined $sat(n,K^2_3)$ and characterized its corresponding extremal graphs. In this paper, we determine $sat(n,K^3_3)$ and $sat(n,K^2_t)$ with $t\geq 4$, together with the structural descriptions of the related extremal saturated graphs.
Read the full abstract

Optimization and Control

Stability of Lagrangian Generalized Nash Equilibriums

Lagrangian generalized Nash equilibriums (LGNEs) were introduced by Rockafellar (2024) for a class of generalized Nash equilibrium problems (GNEPs) in which each player's strategy is subject to conic constraints. This paper investigates the stability properties of the LGNE solution set, specifically focusing on the Aubin property, isolated calmness, and Lipschitz continuous single-valued localization. For general conically constrained GNEPs, characterizations of the Aubin property and isolated calmness of the LGNE solution mapping under canonical perturbations are established. These characterizations are formulated using the coderivative and graph derivative of normal cone mappings. Subsequently, these general results are specialized to GNEPs with equality and inequality constraints, yielding explicit characterizations for both the Lipschitz continuous single-valued localization and isolated calmness of the corresponding LGNE solution mapping, which are described by nonsingularity of linear complementarity sytems. For GNEPs with shared conic constraints, the Aubin property and isolated calmness of the consensus LGNE solution mapping–where identical Lagrange multipliers are assigned to the shared constraint–are first characterized. We further analyze the case when the conic constraints are specialized as equalities and inequalities. Finally, for classical conically constrained Nash equilibrium problems, the Aubin property and isolated calmness of the Lagrangian Nash equilibrium solution mapping are also analyzed.
Read the full abstract

Algebraic Geometry

The Structure of $C^\infty$-Superschemes

This paper establishes a structural generalization of Batchelor's theorem within the framework of $C^\infty$-superschemes. Our main result proves that any Batchelor space satisfies a global splitness condition, establishing an isomorphism between the structure sheaf and its associated graded sheaf. Although this isomorphism is non-canonical, the existence of a splitting endows the structure sheaf with a natural $\mathbb{Z}_{\geq 0}$-grading. This grading is shown to be equivalent to the data of an even superderivation, which we term an Euler vector field. Consequently, global splittings of $C^\infty$-superspaces can be characterized in terms of Euler vector fields, providing a differential-geometric formulation of the splitting.
Read the full abstract

Optimization and Control

Prox-PEP: A Proximal Partial Exact Penalty Algorithm for Weakly Convex Stochastic Nonlinear Programming

This paper considers stochastic optimization problems with weakly convex objective and constraint functions. We propose Prox-PEP, a proximal method equipped with quadratic subproblems. To handle nonlinear equality constraints, we employ an exact penalty approach, transforming them into inequality constraints with auxiliary slack variables. At each iteration, we construct quadratic approximations for both the objective and the constraint functions to facilitate efficient subproblem computation. By carefully designing the second-order approximation matrices, the subproblem constructed via the augmented Lagrangian function is strictly guaranteed to be strongly convex. Furthermore, we adopt a dynamic strategy for the equality penalty parameter: it monotonically increases up to a predefined threshold and remains constant thereafter. Building upon this algorithmic framework, we establish comprehensive asymptotic complexities. We prove that Prox-PEP achieves an $\mathcal{O}(T^{-1/4})$ average expected oracle complexity for $\epsilon$-KKT stationarity, specifically bounding the squared norm of the gradient of the Moreau envelope of the Lagrangian function, alongside constraint violations and complementarity conditions. Additionally, under standard light-tailed martingale noise assumptions, we derive an $\mathcal{O}(T^{-1/8})$ high-probability convergence bound for the norm of the gradient of the Lagrangian's Moreau envelope, as well as $\mathcal{O}(T^{-1/4})$ high-probability bounds for both constraint violations and complementarity conditions.
Read the full abstract

Numerical Analysis · Cross-listed from quant-ph

Symplectic H2 Model Reduction for High-Dimensional Linear Quantum Systems

The $\mathcal{H}_2$ model reduction problem for high-dimensional linear quantum systems is studied under the constraint of physical realizability (PR). This constraint requires preservation of the canonical commutation relations and the quantum input-output structure, and therefore prevents the direct use of standard projection methods. A symplectic Petrov-Galerkin framework is presented, in which reduced-order models automatically satisfy the PR identities by construction. Within this framework, a symplectic variant of the iterative rational Krylov algorithm is developed and referred to as Quantum IRKA (Q-IRKA). At each iteration, an enriched tangential rational Krylov pool is generated from shifted linear solves. A symplectic basis is then extracted by a Gram-Schmidt-type procedure, paired with symplectic conjugates, and normalized so that the reduced trial space satisfies the canonical symplectic constraint. The interpolation points are updated from selected mirror images of the poles of the current reduced-order model, while the reduced-order matrices are obtained exclusively by structure-preserving projection. Numerical experiments on low-channel oscillator-chain systems and on a bosonic Kitaev-chain-inspired benchmark show that Q-IRKA is effective for large-scale linear quantum systems. Symplecticity and PR are preserved to machine precision, and accurate reduced-order models are obtained with moderate computational cost. The results also show that reduction quality depends substantially on dissipation geometry, channel placement, heterogeneity, and reduced order. These findings indicate that scalable $\mathcal{H}_2$ model reduction of linear quantum systems can be achieved while strictly preserving the underlying physical structure.
Read the full abstract

Numerical Analysis · Cross-listed from cs.CV

TriP: A Triangle Puzzle Approach to Robust Translation Averaging

Translation averaging aims to recover camera locations from pairwise relative translation directions and is a fundamental component of global Structure-from-Motion pipelines. The problem is challenging because direction measurements contain no distance information, making the estimation problem highly ill-conditioned and highly sensitive to corrupted observations. In this paper, we propose TriP, a triangle-based framework for robust translation averaging. TriP first infers local relative edge scales from triangle geometry, and then synchronizes the scales of overlapping triangles in the logarithmic domain to recover globally consistent edge lengths and camera locations. By leveraging higher-order consistency across triangles, the proposed method is robust to adversarial, cycle-consistent, and other structured corruptions. In addition, TriP avoids the collapse issue without requiring any extra anti-collapse constraints, since log-scale synchronization excludes the degenerate zero-scale solution by construction. These structural advantages enable a particularly strong theory for exact location recovery. On the practical side, TriP is fully parallelizable, computationally efficient, and naturally scalable to graphs with millions of cameras. Moreover, it outperforms all previous translation averaging methods by a large margin on both synthetic and real datasets.
Read the full abstract

All authors Zhekai Fan, Wanze Li, Jinxin Wang, Yunpeng Shi