Optimization and Control · Cross-listed from eess.SY
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 5 April
This work develops a duality theory for partially observed linear Gaussian models in discrete time. The state process evolves according to a causal but non-Markovian (or higher-order Gauss-Markov) structure, captured by a lower-triangular transition operator, which is related to transformer, with $T$ as the context length. The main contributions are: (i) a dual control system for the linear Gaussian model, formulated as a backward difference equation (B $\Delta$ E); (ii) a duality principle establishing that a specific linear-quadratic optimal control problem for the B $\Delta$ E is dual to the filtering problem for the partially observed model; and (iii) an explicit optimal control formula yielding a novel (transformer-like) linear predictor, referred to as the dual filter, whose computational complexity scales linearly in the time horizon $T$, in contrast to the $O(T^3)$ cost of classical smoothing and Wiener-Hopf approaches.
Saturday 4 April
Information Theory · Cross-listed from cs.LG
Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem
The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is $\textit{group selection}$: given an $M$-dimensional observation with unknown covariance structure, find the finite group whose spectral decomposition best matches the covariance. Naive enumeration of all subgroups of the symmetric group $S_M$ requires exponential time in $M$. We prove that this combinatorial problem reduces to a generalized eigenvalue problem derived from the double commutator of the covariance matrix, yielding a polynomial-time algorithm with complexity $O(d^2M^2 + d^3)$, where $d$ is the dimension of a generator basis. The minimum eigenvector of the double-commutator matrix directly constructs the optimal group generator in closed form, with no iterative optimization. The reduction is exact: the double-commutator minimum eigenvalue is zero if and only if the optimal generator lies in the span of the basis, and its magnitude provides a certifiable optimality gap when it does not. This problem does not appear in the standard catalogs of computational complexity (Garey and Johnson, 1979) and represents a new class linking group theory, matrix analysis, and statistical estimation. We establish connections to independent component analysis (JADE), structured matrix nearness problems, and simultaneous matrix diagonalization, and we show that the double-commutator formulation is the unique approach that is simultaneously polynomial-time, closed-form, and certifiable. We extend the framework to non-Abelian symmetry recovery via a Sequential GEVP with deflation, and add two identifiability theorems characterizing the commutant-lattice ambiguity and the dichotomy on whether $\mathrm{Aut}(\mathbf{R})$ recovers a generative subgroup or only a supergroup.
Read the full abstract
Optimization and Control · Cross-listed from cs.CR
Safety, Security, and Cognitive Risks in State-Space Models: A Systematic Threat Analysis with Spectral, Stateful, and Capacity Attacks
State-Space Models (SSMs) – structured SSMs (S4, S4D, DSS, S5), selective SSMs (Mamba, Mamba-2), and hybrid architectures (Jamba) – are deployed in safety-critical long-context applications: genomic analysis, clinical time-series forecasting, and cybersecurity log processing. Their linear-time scaling is compelling, yet the security properties of their compressed-state recurrent architectures remain unstudied. We present the first systematic treatment of SSM safety, security, and cognitive risks. Seven contributions: (1) Formal threat framework – SSM Attack Surface (five layers), State Integrity Violation (StIV), Cross-Context Amplification Ratio $\mathcal{X}_\mathcal{S}$, and a Spectral Sensitivity Proposition grounded in the $H_\infty$ norm. (2) Three novel attack classes: spectral adversarial attacks (transfer-function gain exploitation), delayed-trigger stateful backdoors (activate thousands of steps after injection), and state capacity saturation (entropy flooding forces silent forgetting). (3) 14 MITRE ATLAS technique extensions across the full tactic chain. (4) Six-profile attacker taxonomy with kill chains for genomics, clinical, and cybersecurity domains. (5) Four cognitive risk hypotheses grounded in state-compression mechanics. (6) Governance-aligned mitigations mapped to CREST, NIST AI 600-1, and EU AI Act. (7) Empirical evaluation: targeted genomic injection achieves $\mathrm{StIV}=0.519$ vs. $0.086$ random ($6.0\times$, $p<0.001$); PGD state injection achieves $156\times$ output perturbation over random; SSD-structured extraction confirmed at $O(N^2)$ vs. $O(N^3)$ query complexity ($N\times$ speedup). Validation on pretrained checkpoints is detailed in the Appendix.
Read the full abstract
Optimization and Control · Cross-listed from physics.optics
ML-based approach to classification and generation of structured light propagation in turbulent media
We study the classification task of structured-light beams after propagation through a random turbulent medium. The received speckle patterns are generated by numerical simulation of a stochastic paraxial propagation model, and the classification task is formulated over a finite alphabet of 15 OAM source classes. We benchmark intensity and autocorrelation inputs using SimpleCNN and ResNet-18 as classifiers. We also quantify the effect of training-set size and receiver-window misalignment. Since additional propagated samples may be costly to obtain, we develop a class-conditioned diffusion model for generative augmentation of turbulence-degraded intensity images. The main contribution is a spectrum-aware diffusion objective: a pixel-domain loss combined with a Fourier-domain Bregman regularizer designed to preserve high-frequency speckle statistics. We prove that this hybrid objective is consistent with the posterior-mean regression target of the diffusion model and show that generated samples substantially improve low-data classification.
Read the full abstract
Number Theory
The Mantovanelli-Hofstadter Sequence
We study the perturbed Hofstadter recurrence introduced by Mantovanelli, $\widetilde{Q}(n)=\widetilde{Q}(n-\widetilde{Q}(n-1))+\widetilde{Q}(n-\widetilde{Q}(n-2))+(-1)^n$, with $\widetilde{Q}(1)=\widetilde{Q}(2)=1$. We prove that this recurrence is well-defined for every positive integer and that $\lim_{n\to\infty}\widetilde{Q}(n)/n=1/2$. We establish the optimal order $\widetilde{Q}(n)=n/2+O(n/\sqrt{\log n})$ and give explicit positive lower and upper bounds for the corresponding normalized limsup. The proof is primarily combinatorial. An odd-even split turns the recurrence into two exact interleavings of binary words, and the resulting Dyck paths define plane forests. Catalan numbers also arise in the enumeration.
Read the full abstract
Combinatorics
There exist Steiner systems $S(2,7,505)$ and $S(2,7,589)$
In this note two Steiner systems $S(2,7,505)$ and two Steiner systems $S(2,7,589)$ are presented. This resolves two of $21$ undecided cases for block designs with block length $7$, mentioned in Handbook of Combinatorial Designs.
Numerical Analysis · Cross-listed from cs.LG
A Theory-guided Weighted $L^2$ Loss for solving the BGK model via Physics-informed neural networks
While Physics-Informed Neural Networks offer a promising framework for solving partial differential equations, the standard $L^2$ loss formulation is fundamentally insufficient when applied to the Bhatnagar-Gross-Krook (BGK) model. Specifically, simply minimizing the standard loss does not guarantee accurate predictions of the macroscopic moments, causing the approximate solutions to fail in capturing the true physical solution. To overcome this limitation, we introduce a velocity-weighted $L^2$ loss function designed to effectively penalize errors in the high-velocity regions. By establishing a stability estimate for the proposed approach, we shows that minimizing the proposed weighted loss guarantees the convergence of the approximate solution. Also, numerical experiments demonstrate that employing this weighted PINN loss leads to superior accuracy and robustness across various benchmarks compared to the standard approach.
Read the full abstract
Algebraic Geometry
Transmission permutations and Demazure products in Hurwitz–Brill–Noether theory
A line bundle on a curve with two marked points can be special in many ways, as measured by the global sections of all of its twists by these points. All of this information is conveniently packaged into a permutation, which we call the transmission permutation. We prove that when twice-marked curves are chained together, these permutations are composed via the Demazure product; in reverse, bundles with given permutation can be enumerated via reduced decompositions of a permutation. This paper demonstrates the utility of transmission permutations by giving a short derivation of the basic dimension bounds of both classical Brill–Noether theory and Hurwitz–Brill–Noether theory in a unified framework. The difference between the two cases derives from taking permutations in either symmetric groups or affine symmetric groups.
Read the full abstract
Differential Geometry
On normal forms of gradient Ricci 4-solitons
In this note we analyze the normal form of the operator $\hat{R} + \frac{1}{2}\hat{H}$ of a gradient Ricci 4-soliton in Cao & Tran. In particular, we show that the curvature operator $\hat{R}$ of the Koiso-Cao soliton inherits this normal form. By work of D. Johnson, this yields a normal form for the curvature operator of the Koiso-Cao soliton relative to the space of algebraic Kähler curvature operators.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Lotka-Sharpe Neural Operators for Control of Population PDEs
Age-structured predator-prey integro-partial differential equations provide models of interacting populations in ecology, epidemiology, and biotechnology. A key challenge in feedback design for these systems is the scalar $\zeta$, defined implicitly by the Lotka-Sharpe nonlinear integral condition, as a mapping from fertility and mortality rates to $\zeta$. To solve this challenge with operator learning, we first prove that the Lotka-Sharpe operator is Lipschitz continuous, guaranteeing the existence of arbitrarily accurate neural operator approximations over a compact set of fertility and mortality functions. We then show that the resulting approximate feedback law preserves semi-global practical asymptotic stability under propagation of the operator approximation error through various other nonlinear operators, all the way through to the control input. In the numerical results, not only do we learn “once-and-for-all” the canonical Lotka-Sharpe (LS) operator, and thus make it available for future uses in control of other age-structured population interconnections, but we demonstrate the online usage of the neural LS operator under estimation of the fertility and mortality functions.
Read the full abstract
K-Theory and Homology
Cohomology of special unitary groups and congruence subgroups
We prove a homotopy invariance result for the first cohomology group of the special unitary group $\mathrm{SU}_3(F[t])$ with coefficients in irreducible representations of $\mathrm{PGL}_2(F)$. The main theorem establishes that this cohomology is naturally isomorphic to the corresponding cohomology of $\mathrm{PGL}_2(F)$.
Read the full abstract
Probability
A homogenization principle for total variation
A homogenization principle for total variation We prove an inequality comparing the variational distance between pairs of product probability measures to its homogenized counterpart. If $P_1,\ldots,P_n,Q_1,\ldots,Q_n$ are arbitrary probability measures on a measurable space and $\bar P:=\frac1n\sum_{i=1}^n P_i, \bar Q:=\frac1n\sum_{i=1}^n Q_i $, we show that $$TV\!\left(\bigotimes_{i=1}^n P_i, \bigotimes_{i=1}^n Q_i\right) \;\ge\; c\,TV(\bar P^{\otimes n},\bar Q^{\otimes n}),$$ where $c>0$ is a universal constant. The proof is based on a one-dimensional representation of total variation between products. We embed pairs of probability distributions $P_i,Q_i$ into positive measures $\eta_i$ on $\mathbb{R}$. We then define a functional $T$ over measures on $\mathbb{R}$ that realizes TV over products via convolution: $TV\!\left(\bigotimes_{i=1}^n P_i, \bigotimes_{i=1}^n Q_i\right)=T(\eta_1*\cdots *\eta_n)$. Our main analytic discovery is that for the relevant class of positive measures $\eta_i$, the convolution inequality $T(\eta_1*\cdots*\eta_n) \ge c\,T\!\left(\bar\eta^{*n}\right)$ holds, where $\bar\eta=\frac1n\sum_{i=1}^n \eta_i$. Finally, a higher-dimensional lifting argument shows that $T\!\left(\bar\eta^{*n}\right)\ge TV(\bar P^{\otimes n},\bar Q^{\otimes n})$. To our knowledge, both the exact representation and the convolution inequality are new.
Read the full abstract
Mathematical Physics
Ergodic Schrodinger operators on the Bethe lattice and a modified Thouless formula
The main result of this paper is a modified Thouless formula relating the density of states for ergodic Schrodinger operators on the Bethe lattice to the Lyapunov exponent. The modified Thouless formula consists of a Thouless-like term, involving the density of states, and a remainder term. The remainder term vanishes when the connectivity $\kappa$ equals one, yielding the usual Thouless formula for ergodic Schrodinger operators on $\mathbb{Z}$. We prove the remainder term is nontrivial for $\kappa \geq 2$. We also discuss the automorphism group of the Bethe lattice and its relation to ergodic Schrodinger operators. In particular, we clarify the use of the multiparameter noncommutative ergodic theorem in evaluating the limit of Green's functions along certain paths.
Read the full abstract
Algebraic Geometry
An approach to the abundance conjecture for Kähler varieties via algebraic reduction
In this article, we establish a strategy to the abundance conjecture for Kähler varieties via induction on algebraic dimension. Our strategy is to reduce the abundance conjecture for Kähler varieties to the abundance conjecture for projective varieties using the algebraic reduction fibration. In dimension 4, we apply our inductive strategy to obtain some cases of the abundance conjecture for Kähler fourfolds that are not algebraic or have trivial $K_X$.
Read the full abstract
Analysis of PDEs
Local null controllability of the complete N-dimensional Ladyzhenskaya-Boussinesq model
This work investigates both local null controllability and large time null controllability for a class of complete Ladyzhenskaya Boussinesq systems, where the controls are distributed and supported on small subsets of the domain. The proof of local null controllability relies on classical techniques, including Carleman estimates and Liusternik Inverse Mapping Theorem. Nevertheless, the presence of nonlinearities in both the velocity and temperature equations necessitates careful treatment.
Read the full abstract
Optimization and Control
Efficient Convexification of Kolmogorov-Arnold Networks with Polynomial Functional Forms Via a Continuous Graham Scan Approach
Deterministic global optimization of nonlinear models is important in many scientific and engineering applications. This framework typically involves repeatedly solving convex relaxations of the nonconvex problem, meaning that the strength of the relaxations and the cost of computing them directly determine overall efficiency and solution quality. In this work, we develop a tailored continuous convexification framework for Kolmogorov-Arnold Networks in which the univariate components are polynomial functions. By exploiting the additive separable structure of this architecture, the relaxation problem reduces to computing tight convex envelopes of univariate polynomials. We propose a continuous variant of the classical Graham Scan that constructs these envelopes exactly by identifying the bitangents of the polynomial convex hull without discretization or factorable reformulations. We establish the correctness of the algorithm and characterize its computational complexity, and show how these envelopes can be combined to construct strong convex relaxations for polynomial KANs. Computational results demonstrate that the proposed relaxations are both strong and robust, often producing bounds that are comparable, or even orders of magnitude tighter than relaxations of state-of-the-art global optimization solvers while remaining computationally efficient.
Read the full abstract
Information Theory
Structural Impossibility of Antichain-Lattice Partial Information Decomposition
Partial Information Decomposition (PID) represents multivariate mutual information via antichain-lattice that aims to specify which source groups can recover which informational components of a target. For three or more sources, widely desired PID axioms become mutually incompatible. This is often treated as an axiomatic tuning issue. This paper argues that the obstruction is representational, rooted in the antichain indexing itself, so that purely axiomatic adjustments within an antichain-lattice structure cannot resolve it in general. We first introduce System Information Decomposition (SID) for the special target-free three-variable setting, obtaining a self-consistent entropy decomposition with an operational redundancy definition. More fundamentally, we then show that for general multivariate PID, there is no universal rule that recovers the decomposed mutual information from the antichain-indexed information atoms. In particular, two systems can share identical atoms regardless of any axioms while having different mutual information. These results reveal the limits of antichain-lattice and motivate relation-based foundations for multivariate information measures.
Read the full abstract
Complex Variables
Electrostatic skeletons and condition of strict descent
Given a precompact domain $\Omega \subseteq\mathbb{R}^2$, the electrostatic skeleton of $\Omega$ is defined as a positive measure inside $\Omega$, supported on a set with no simple loops, which generates $\partial \Omega$ as an equipotential curve. Eremenko conjectured that every convex polygon admits a unique electrostatic skeleton. This conjecture has since been proven for triangles and regular polygons. In this paper, we will prove the conjecture for quadrilaterals with a line of symmetry using arguments from conformal geometry. We will also discuss a natural condition that implies the existence of electrostatic skeletons.
Read the full abstract
Analysis of PDEs
Asymptotic behavior of the wave equation subject to a Kelvin-Voigt nonlocal damping
In this article, we examine the well-posedness and asymptotic behavior of the energy associated with the wave equation that incorporates a Kelvin-Voigt nonlocal damping structure given by $-||\nabla u_t(t)||_2^2 \Delta u_t$. Utilizing the robust framework of nonlinear semigroups, we successfully demonstrate the existence of both strong and weak solutions. Our findings reveal that the decay rate for these solutions is optimally characterized by $1/t$, highlighting the effectiveness of this dissipative structure. This work not only enhances our understanding of the wave equation under nonlocal damping but also emphasizes the crucial balance between mathematical rigor and physical relevance.
Read the full abstract
Complex Variables
Hadamard-Type Asymptotics for Products of Best Rational Approximation Errors
Let $E\subset\mathbb{C}$ be a compact set with connected complement, and let $\rho_{n,m}(f;E)$ denote the error of best uniform rational approximation to a function $f$ analytic on $E$ by rational functions whose numerator and denominator have degrees at most $n$ and $m$, respectively. The Saff–Gonchar theorem is the fundamental result describing the asymptotic behavior of rational approximation errors along the rows of the Walsh table. It was first proved by Saff for continua with connected complement and Jordan boundary and subsequently extended by Gonchar to regular compact sets. Motivated by a comparison of the Saff–Gonchar theorem with Hadamard's classical theorem on Hankel determinants, we study, for each fixed $m\ge 0$, the asymptotic behavior as $n\to\infty$ of the products $$ \prod_{k=0}^{m}\rho_{n-m+k,k}(f;E). $$ We establish Hadamard-type asymptotic formulas for these products on the closed unit disc and, more generally, on continua with connected complement and Jordan boundary. In the disc case, our approach combines Hadamard's classical theorem and the Saff–Gonchar theorem with weighted Hankel operators and an AAK-type theorem for meromorphic approximation. We also show that there exists a common subsequence along which the extremal exponential behavior of these products and of the corresponding products on the closed Green sublevel sets $E_R$ is attained.
Read the full abstract
Functional Analysis
A Functional-Analytic Framework for Nonlinear Adaptive Memory: Hierarchical Kernels, State-Dependent Sensitivity, and Memory-Dependent Functionals
This work develops a systematic functional-analytic framework for nonlinear adaptive memory, where the influence of past events depends on both elapsed time and the state values along a trajectory. The framework comprises three hierarchical layers. First, memory kernels are classified into mathematically admissible, regular (uniformly bounded, normalized, Lipschitz), and generalized (bounded variation, possibly sign-changing) classes. Second, adaptive sensitivity functions Lambda(s, f(s)) are introduced, satisfying natural conditions; a concrete construction based on historical deviation accumulation interpolates continuously between instantaneous response and history-dependent sensitivity, with an explicit Lipschitz estimate ||Lambda_f - Lambda_g||_inf <= L_Lambda ||f - g||_inf. Third, an adaptive memory-dependent functional S_{kappa, Lambda}(f) = sup_{t in I} (|f(t)| + integral_0^t Lambda(s, f(s)) kappa(t-s) |f(s)| ds) and the associated set M_{kappa, Lambda}(I) = {f : S_{kappa, Lambda}(f) < infinity} are constructed. Fundamental properties of the framework are established, including absolute convergence, measurability, uniform boundedness, positive definiteness, and comparison with the classical supremum norm. It is shown that C(I) is strictly contained in M_{kappa, Lambda}(I), with discontinuous functions (e.g., indicator functions of subintervals) belonging to the set – capturing abrupt signal changes such as on-off switching in nonlinear systems. When the maximum of |f| is attained in the interior of the interval, a strict inequality S_{kappa, Lambda}(f) > ||f||_inf is proved, demonstrating the nontrivial contribution of the memory component.
Read the full abstract
Analysis of PDEs
Regularity and singularity of the blow-up curve for a wave equation with a derivative nonlinearity and a scale-invariant damping
In this article, we investigate the blow-up behavior of solutions to the one-dimensional damped nonlinear wave equation, namely $$ \partial_t^2 u - \partial_x^2 u + \frac{\mu}{1 + t} \partial_t u = |\partial_t u|^p \quad (p > 1). $$ Under the assumption of sufficiently large and smooth initial data, we establish that the blow-up curve is continuously differentiable ($\mathcal{C}^1$). A key step in our analysis involves the characterization of the blow-up profile of the solution. The proof relies on transforming the equation into a first-order system and adapting the techniques of Sasaki in \cite{Sasaki2018,Sasaki2019} which have elegantly extended the method of Caffarelli and Friedman \cite{Caffarelli1986} to nonlinear wave equations with time derivative nonlinearity, but without the scale-invariant term ($\mu =0$).
Read the full abstract
Algebraic Geometry
A categorical and algebro-geometric theory of localization
We study cohomology classes whose restriction to the complement of a closed subset vanishes. The localisation sequence shows that their lifts to cohomology with support form a torsor under the image of the connecting morphism. We establish the behaviour of this torsor under excision, Cartesian base change, proper pushforward when compatible trace data are available, and external products, and characterise compatible local constructions in these terms. Under purity, excision and orientation hypotheses, its group of translations is identified with the image of the global-to-link Gysin transgression and hence with a subgroup of the kernel of multiplication by the Euler class; under a natural surjectivity hypothesis it is equal to this kernel. Injectivity of Euler multiplication therefore gives uniqueness of the supported lift, while concentration recovers the usual localisation formulae. In a stable categorical enhancement, we relate the set-level torsor to the corresponding space of nullhomotopies. For characteristic-class defects, we introduce Milnor localisation torsors and study their comparison morphisms and local index decompositions. For isolated hypersurface singularities, we describe the secondary ambiguity in terms of links and identify distinguished supported representatives arising from vanishing cycles.
Read the full abstract
Combinatorics
Spectral Theory of the Toroidal 3D Queen Graph
We study the adjacency spectrum of the toroidal three-dimensional queen graph $G_n$ on $(\mathbb{Z}_n)^3$. Since $G_n$ is a Cayley graph on an abelian group, its adjacency matrix is diagonalized by Fourier characters. For each frequency $a\in(\mathbb{Z}_n)^3$, the corresponding eigenvalue is $\lambda(a)=n\mu(a)-13$, where $\mu(a)$ counts the queen directions orthogonal to $a$ modulo $n$. In the generic odd case, meaning $n$ odd with $3\nmid n$, the possible values of $\mu(a)$ are exactly $0,1,2,3,4,$ and $13$, and each multiplicity is given by an explicit polynomial in $n$. The proof combines a geometric classification of frequency points by orthogonality type with two global counting identities.
Read the full abstract
Logic
Tarskian truth theories over set theory
This work uses mostly model-theoretic methods to establish new proof-theoretic theorems about several axiomatic theories of truth over KP (Kripke-Platek set theory) and stronger theories, especially ZF (Zermelo-Fraenkel set theory).
Numerical Analysis
A note on the spectral distribution of non-Hermitian block matrices with Toeplitz blocks
In the present paper, we are concerned with the study of the spectral distribution of matrix-sequences showing a non-Hermitian block structure with Toeplitz blocks. We use the notion of geometric mean of matrices and the theory of Generalized Locally Toeplitz (GLT) sequences to perform our analysis and produce some numerical tests and visualizations to confirm our theoretical derivations.
Read the full abstract
Combinatorics
On the Algebraic Properties of r-circulant Matrices Associated with Generalized k-Pell-Tribonacci Numbers
This study examines the properties of an r-circulant matrix whose entries are defined by the generalized k-Pell-Tribonacci sequence {P_k,n}. Explicit expressions are derived for the Frobenius (Euclidean) norm and the entrywise \ell_1-norm, together with closed-form formulas for the eigenvalues and the determinant of the matrix. Furthermore, upper and lower bounds for the spectral norm are established, yielding results that generalize previously reported ones corresponding to particular sequences while also providing sharper bounds for the considered norms.
Read the full abstract
Geometric Topology
Normal-Euler excess for disjoint nonorientable surfaces in a closed $4$-manifold
Let \(M\) be a closed connected oriented topological \(4\)-manifold. We prove that if \(F_1,\dots,F_r\subset M\) are pairwise disjoint connected locally flat topologically embedded nonorientable surfaces with nonorientable genera \(g_i\), same-sign twisted normal Euler numbers \(e_i\), and \( [F_1]+\cdots+[F_r]=0\in H_2(M;\F_2), \) then the normal-Euler excess \( \sum_{i=1}^r \bigl(\abs{e_i}-2g_i\bigr) \) is bounded above by a constant depending only on \(M\). Thus same-sign mod-\(2\)-null families of disjoint nonorientable surfaces in a fixed ambient \(4\)-manifold have uniformly bounded total excess over Massey's \(S^4\) bound. The proof combines a tubing construction with the signature and Euler-characteristic formulas for \(2\)-fold branched covers. As corollaries, every closed oriented topological \(4\)-manifold contains only finitely many pairwise disjoint locally flat topologically embedded copies of \(\RP^2\) with \(\abs{e}>2\), and only finitely many pairwise disjoint tubular neighborhoods modeled on real \(2\)-plane bundles over \(\RP^2\) whose total spaces are orientable and whose twisted Euler numbers have absolute value greater than \(2\). When \(M\) is a homology \(4\)-sphere, the ambient error term vanishes, and the theorem recovers Massey's sharp inequality \(\abs{e(F)}\le 2g(F)\) for nonorientable surfaces in \(S^4\).
Read the full abstract
Analysis of PDEs
From Linear to Nonlinear: A Resolvente criterion for Polynomial Stability of Semigroups Generated by Monotone Operators
The Borichev–Tomilov theorem \cite{BT2010} provides a sharp characterization of polynomial decay for linear $C_0$-semigroups in terms of resolvent growth along the imaginary axis. In the nonlinear setting, the absence of a spectral theory renders the imaginary-axis approach inapplicable. In this paper, we develop a new framework for nonlinear maximal monotone operators in Hilbert spaces by replacing spectral analysis on $i\mathbb{R}$ with the asymptotic analysis of the real resolvent equation \[ \lambda x_\lambda + \mathcal{A}(x_\lambda) \ni y, \quad \lambda \to 0^+. \] We show that, for homogeneous operators (and suitable perturbations), the blow-up rate of $\|x_\lambda\|$ at the origin reveals the effective nonlinear scaling of the operator and determines the corresponding polynomial decay rate of the associated semigroup through a coercive dissipation mechanism. This provides a nonlinear Tauberian-type principle for a broad class of degenerate dissipative systems. The approach recovers, in particular, the optimal $1/t$ decay for the wave equation with nonlocal Kelvin–Voigt damping recently obtained by Cavalcanti et al.\ (2025), and allows one to justify decay estimates for weak solutions in situations where classical multiplier methods require higher regularity. It also clarifies the structural limitations of the method, identifying regimes where additional geometric or time-domain arguments are necessary.
Read the full abstract
Optimization and Control
Computing Rare Probabilities of Voltage Collapse
This paper introduces a framework based on Large Deviation Theory (LDT) to accurately and efficiently compute the rare probabilities of voltage collapse. We formulate the problem as finding the most probable failure point (the instanton) on the stability boundary and derive both first-order and second-order approximations for the collapse probability. The second-order method incorporates the local curvature of the stability boundary, yielding higher accuracy. This LDT framework generalizes methods based on Mahalanobis distance and is extensible to non-Gaussian uncertainties. We validate our approach on test systems, demonstrating that the LDT estimates converge to Monte Carlo results in the rare-event regime where direct sampling becomes computationally prohibitive.