Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 1 March
This work establishes two versions of the Pontryagin-type maximum principles for partially observed optimal control of coupled forward stochastic partial differential equations (FSPDEs) and backward stochastic differential equations (BSDEs) with jumps in convex control domains. The FSPDE-BSDE system is driven by cylindrical Wiener processes, finite-dimensional Brownian motions, and compensated Poisson random measures. For systems with deterministic coefficients, a direct method is employed and particular attention is focused on establishing the well-posedness of a singular backward SPDE with jumps. For systems with random coefficients, a Malliavin calculus approach is developed. The main novelty here is the establishment of the well-posedness of an operator-valued SPDE with jumps, which provides a new stochastic flow representation for linear SPDEs with jumps.
Dynamical Systems
Relay transitions and invasion thresholds in multi-strain rumor models: a chemical reaction network approach
The historical quest for unifying the concepts and methods of Chemical Reaction Networks theory (CRNT), Mahematical Epidemiology (ME) and ecology has received increased attention in the last years and has led in particular to the development of the symbolic package EpidCRN, for automatic analysis of positive ODEs, which implements tools from all these disciplines like siphons, reproduction functions and invasion numbers, Child-Selection expansions, etc. We illustrate below the convenience of using this package on some recent online social network (OSN) rumor spreading models, with emphasis on showing how CRNT throws a new light on their analysis. Specifically, we organise the boundary dynamics via the lattice of invariant faces generated by minimal siphons, and establish that stability transitions take the form of relays: for each distance-one cover in the siphon lattice, a single invasion inequality simultaneously governs the loss of transversal stability of the resident equilibrium and the existence of a successor equilibrium on the adjacent face. For the base OSN model ($\omega=0$) all boundary and interior equilibria admit explicit rational formulas, and the relay table is fully verified using invasion numbers computed symbolically by EpidCRN. For the variant with waning spreading impulse ($\omega>0$), the relay structure is analysed via transversal Jacobian blocks; three equilibria involve irrational coordinates and their stability is predicted by the relay framework subject to direct Routh–Hurwitz verification. The relay mechanism is then situated in its normal-form context (siphon-induced transcritical bifurcations), distinguished from classical transcritical bifurcations along four structural axes, and compared with Hofbauer invasion graphs.
Read the full abstract
Functional Analysis
A note on the Goldberg-Thorp example in light of the classification of linear ill-posed problems in Banach spaces
This note considers the strictly singular mapping, denoted by $B$, from $\ell^1$ onto $\ell^2$ of an example by Goldberg and Thorp from 1963 as a typical hybrid-type operator in the context of the classification of ill-posed linear operators in infinite-dimensional Banach spaces. The null-spaces of hybrid-type operators are not complemented and therefore need special attention. More generally, a given well-posedness definition for linear operators requiring both closed range and complemented null-space is motivated by the continuity of occurring pseudo-inverse operators as a stability criterion. With respect to the operator $B$, structure, representation and properties of the operator and its adjoint are summarized in a theorem. Moreover, limitations and opportunities of regularization approaches for the treatment of $B$ are outlined.
Read the full abstract
Differential Geometry
Classification of closed minimal hypersurfaces with constant scalar curvature in $\mathbb{S}^5$
In this paper, we prove that any closed minimal hypersurface $M^4$ in the $5$-dimensional unit sphere $\mathbb{S}^5$ with constant scalar curvature and constant $3$-th mean curvature must be isoparametric. To be precise, $M^4$ is either an equatorial 4-sphere, a product of spheres $\mathbb{S} ^{2}(\frac{\sqrt{2}}{2}) \times \mathbb{S} ^{2}(\frac{\sqrt{2}}{2})$ or $\mathbb{S} ^{1}(\frac{1}{2}) \times \mathbb{S} ^{3}(\frac{\sqrt{3}}{2})$, or a Cartan's minimal hypersurface. In particular, the value of the squared norm of the second fundamental form $S$ can only be 0, 4, or 12. This result strongly supports Chern's conjecture.
Read the full abstract
Dynamical Systems
Mathematical analysis of a model for glycolytic oscillations in pancreatic $\beta$-cells
Insulin secretion is pulsatile, with a period of about 5 min, coexisting with an ultradian rhythm (period of about 1 h), and a circadian (daily) rhythm. These rhythms are disrupted in type II diabetes. The 5-min rhythm is typically maintained even at fasting glucose levels, when there is no electrical activity in the insulin-secreting pancreatic $\beta$-cells.It has been proposed that this rhythm is due to oscillations in glycolysis, the first stage of glucose metabolism. A mathematical model for these oscillations was developed by Paul Smolen (the `Smolen model') and is an important element of the Integrated Oscillator Model (IOM) for $\beta$-cell activity across all levels of glucose. In this article, we provide a detailed mathematical analysis of the dynamics underlying oscillations in the Smolen model. In particular, we demonstrate how the biophysical mechanism for oscillations in this model, a substrate-depletion mechanism, can be decomposed mathematically using geometric singular perturbation analysis. We link the `pulse' and `refill' stages of the oscillation to distinct dynamic regimes and describe the flow dynamics through these regimes. This is the first detailed mathematical analysis of the Smolen model for glycolytic oscillations that are hypothesised to occur at fasting glucose levels and, in some cases, under superthreshold conditions that would occur after a meal.
Read the full abstract
Number Theory
Weighted averages of $p$-adic hypergeometric functions and traces of Frobenius of elliptic curves
In this paper, we aim to study traces of Frobenius of certain one parameter families of elliptic curves and their relationships with $p$-adic hypergeometric functions. For example, we consider a DIK family of curves and establish the trace of Frobenius as weighted averages of special values of certain families of $p$-adic hypegeometric functions, where the average is taken over the arrays of parameters. Moreover, we consider Jacobi curves and express the trace of Frobenius as a special values of $p$-adic hypergeomtric functions. As a consequence of these results we obtain four summation identities for the $p$-adic hypegeometric functions that arise from the DIK family. Furthermore, we obtain $p$-adic analogous of Euler and Pfaff transformations for certain $p$-adic hypergemetric functions.
Read the full abstract
Optimization and Control
A First Step Towards Mesh-Free Probabilistic Shape Optimization
We present an initial implementation of a probabilistic PDE-constrained shape optimization algorithm. Our method is based on a novel probabilistic representation of the shape derivative, which is evaluated using Monte Carlo sampling; and does not rely on a mesh. The underlying state is represented with a neural network-based PDE solver on point clouds. The methodology is applied throughout to a benchmark tracking problem.
Read the full abstract
Analysis of PDEs
Explicit Formula Of The Critical Mass And The Energy Ground State Solution For The Mixed Local-Nonlocal Schrodinger Equation For The In-Between Critical Exponents Case
Our first main contribution consists in establishing an explicit formula of the critical mass via the best constant of the Gagliardo-Nirenberg inequality for the mixed local-nonlocal Laplacian. We also prove the existence of an optimizer of the Gagliardo-Nirenberg inequality for the mixed local-nonlocal operator. We then show that the optimizer (after some suitable scaling) is an energy ground state solution (with critical mass ). This is a key ingredient to determine sufficient and necessary conditions of existence and non-existence of energy ground state solutions in the in-between critical exponents case. Finally, we show that the energy ground state solution uc0 is an optimizer of the Gagliardo-Nirenberg inequality for the mixed local-nonlocal operator.
Read the full abstract
Analysis of PDEs
Ground State Solutions For Local-Nonlocal Shrodinger Equations In the Presence Of Two Critical Exponents
In this paper, we address the existence of ground state solutions for Schrodinger equations in the presence of local and nonlocal operators and two critical nonlinearities associated with each operator. The situation is completely solved in the critical case both in the local and in the nonlocal settings. However, methods developed in these cases cannot extend to local-nonlocal operators when we have two critical power nonlinearities. This unprecedented situation in PDEs presents some challenges, and its resolution will open the door to solve similar problems. Our approach is essentially based on a subtle generalization of the Lieb translation theorem. We will also discuss the positivity of the ground states as well as their regularity.
Read the full abstract
Classical Analysis and ODEs
Krall-Type Orthogonal Polynomials and Integrable Isomonodromic Deformations
Krall-type polynomials are orthogonal polynomials for a Stieltjes measure obtained by adding jumps at the boundary of the orthogonality interval of either the generalized Laguerre polynomials or the Jacobi polynomials. We show that both the recurrence relations and the second-order linear differential equations defining these polynomials are explicitly determined in terms of specific solutions of certain integrable systems. When only one jump is present, this leads to integrable cases of the Painlevé III or the Painlevé V equation. In the case of two jumps, first studied by Koornwinder [Canad. Math. Bull. 27 (1984), 205-214], we obtain a new integrable system of partial differential equations of Schlesinger type. When the jumps are equal and the starting polynomials are the Gegenbauer polynomials, this system reduces to an integrable case of the Painlevé V equation.
Read the full abstract
Spectral Theory
Polynomial bounds for eigenfunctions and eigenvalues on random covers of hyperbolic surfaces
Let $X$ be a compact connected orientable hyperbolic surface and let $X_n$ be a degree $n$ cover, taken uniformly at random. We show that, with high probability, the $L^\infty$ norm of every Laplace eigenfunction on $X_n$ with bounded eigenvalue decays polynomially in $n$. This gives a polynomial decay analogue of the logarithmic bound of Gilmore–Le Masson–Sahlsten–Thomas [arXiv:1912.09961] in the Weil–Petersson model. Using similar methods, we also show that, with high probability, the distribution of eigenvalues of the Laplacian on $X_n$ converges to the spectral measure of the hyperbolic plane with polynomially decaying error. Our proof relies on the Selberg pre-trace formula and a variant of the polynomial method.
Read the full abstract
General Topology
A new order for ideal sequential compactness
Let $\mathcal{I}$ be an ideal on $\omega$ and $X$ be a topological space. A sequence $(x_n)_{n\in \omega}$ in $X$ is $\mathcal{I}$-convergent if there is $x\in X$ such that $\{n\in \omega:x_n\notin U\}\in\mathcal{I}$ for every open neighborhood $U$ of $x$. We examine the following variant of sequential compactness associated with $\I$: $X$ is $\mathrm{BW}(\mathcal{I})$ if for every sequence $(x_n)_{n\in \omega}$ in $X$ there is $A\notin\mathcal{I}$ such that $(x_n)_{n\in A}$ is $\mathcal{I}$-convergent. We introduce a new preorder on ideals, denoted $\leq_{BW}$, such that $\mathcal{I}\leq_{BW}\mathcal{J}$ implies that every $\mathrm{BW}(\mathcal{J})$ space is $\mathrm{BW}(\mathcal{I})$. Our main result states that under CH the above implication can be reversed in the case of $\mathbf{F_\sigma}$ ideals $\I$ and $\J$. We compare $\leq_{BW}$ with the Katětov order and study the relation $\leq_{BW}$ among some well-known ideals (e.g. the van der Waerden ideal $\mathcal{W}$ consisting of all subsets of $\omega$ that do not contain arbitrary long finite arithmetic progressions). As a consequence, we answer two open questions posed by Filipów and Tryba in [Top. App. {178} (2014), 438–452] concerning comparison of $\mathrm{BW}(\mathcal{W})$ with the class of sequentially compact spaces.
Read the full abstract
Number Theory
Inequalities for the number of $t$-hooks in two partition classes arising from sum-product identities
Motivated by recent study on the number of $t$-hooks in partitions arising from Euler's partition identity, we investigate the number of $t$-hooks in the sets from the first Rogers-Ramanujan identity and the first little Göllitz identity. In particular, for $t=1,2$, we obtain the generating functions for the number of $t$-hooks and prove $t$-hook inequalities by deriving asymptotic formulas.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Multipartite parity bounds and total correlation
This paper studies multipartite observables formed from sums of local self-adjoint contractions on tensor product Hilbert spaces. The square of such a sum has a parity structure: after decomposing each local product into commutator and anticommutator parts, the odd parity terms cancel and only even parity contributions remain. This yields a norm bound in terms of a family of pairwise defect weights built from local commutator and anticommutator norms. These defect weights also control an information theoretic estimate. The excess of the observable expectation above the product state threshold is shown to necessarily carry a definite amount of total correlation. Under a natural $\ell^{2}$-type bound on each local family, this product state threshold becomes explicit, which leads to a fully explicit lower bound on total correlation. A simple depolarizing example illustrates the resulting decay mechanism under local noise.
Read the full abstract
Numerical Analysis · Cross-listed from physics.flu-dyn
Structure-preserving Randomized Neural Networks for Incompressible Magnetohydrodynamics Equations
The incompressible magnetohydrodynamic (MHD) equations are fundamental in many scientific and engineering applications. However, their strong nonlinearity and dual divergence-free constraints make them highly challenging for conventional numerical solvers. To overcome these difficulties, we propose a Structure-Preserving Randomized Neural Network (SP-RaNN) that automatically and exactly satisfies the divergence-free conditions. Unlike deep neural network (DNN) approaches that rely on expensive nonlinear and nonconvex optimization, SP-RaNN reformulates the training process into a linear least-squares system, thereby eliminating nonconvex optimization. The method linearizes the governing equations through Picard or Newton iterations, discretizes them at collocation points within the domain and on the boundaries using finite-difference schemes, and solves the resulting linear system via a linear least-squares procedure. By design, SP-RaNN preserves the intrinsic mathematical structure of the equations within a unified space-time framework, ensuring both stability and accuracy. Numerical experiments on the Navier-Stokes, Maxwell, and MHD equations demonstrate that SP-RaNN achieves higher accuracy, faster convergence, and exact enforcement of divergence-free constraints compared with both traditional numerical methods and DNN-based approaches. This structure-preserving framework provides an efficient and reliable tool for solving complex PDE systems while rigorously maintaining their underlying physical laws.
Read the full abstract
Analysis of PDEs
Mixed double phase equations with local and nonlocal operators
In this paper, we study a new class of mixed double phase problems that combine local and nonlocal operators. We consider two different models. The first model is driven by the fractional $p$-Laplacian together with a local double phase operator, while the second model involves the local $p$-Laplacian coupled with a fractional double phase operator. In order to describe the interaction between local and nonlocal effects within the double phase framework, we introduce an appropriate variational setting based on classical and fractional Musielak-Orlicz Sobolev spaces. Within this setting, we establish several existence and multiplicity results for weak solutions by means of variational and topological techniques. In particular, for the problem driven by the fractional $p$-Laplacian and a local double phase operator, we prove the existence of a nonnegative solution using the Nehari manifold method in the presence of concave-convex nonlinearities. We also investigate the associated Brezis-Nirenberg type problem and obtain the existence of infinitely many solutions via genus theory. For the problem governed by the local $p$-Laplacian and a fractional double phase operator, we show the existence of at least two nontrivial constant sign solutions by exploiting the variational structure of the associated energy functional. Furthermore, in the subcritical case, we prove the existence of a least energy sign-changing solution by combining the Poincaré-Miranda existence theorem with the quantitative deformation lemma.
Read the full abstract
Numerical Analysis
Adaptive-Growth Randomized Neural Networks for Level-Set Computation of Multivalued Nonlinear First-Order PDEs with Hyperbolic Characteristics
This paper proposes an Adaptive-Growth Randomized Neural Network (AG-RaNN) method for computing multivalued solutions of nonlinear first-order PDEs with hyperbolic characteristics, including quasilinear hyperbolic balance laws and Hamilton–Jacobi equations. Such solutions arise in geometric optics, seismic waves, semiclassical limit of quantum dynamics and high frequency limit of linear waves, and differ markedly from the viscosity or entropic solutions. The main computational challenges lie in that the solutions are no longer functions, and become union of multiple branches, after the formation of singularities. Level-set formulations offer a systematic alternative by embedding the nonlinear dynamics into linear transport equations posed in an augmented phase space, at the price of substantially increased dimensionality. To alleviate this computational burden, we combine AG-RaNN with an adaptive collocation strategy that concentrates samples in a tubular neighborhood of the zero level set, together with a layer-growth mechanism that progressively enriches the randomized feature space. Under standard regularity assumptions on the transport field and the characteristic flow, we establish a convergence result for the AG-RaNN approximation of the level-set equations. Numerical experiments demonstrate that the proposed method can efficiently recover multivalued structures and resolve nonsmooth features in high-dimensional settings.
Read the full abstract
Mathematical Physics · Cross-listed from nlin.SI
Special solutions to five autonomous integrable partial difference equations via the third and sixth Painlevé equations and the Garnier system in two variables
In this paper, we study special solutions of five autonomous integrable partial difference equations (P$\Delta$Es). More precisely, we show that these P$\Delta$Es admit special solutions that are described by non-autonomous ordinary difference equations arising from Bäcklund transformations of the third and sixth Painlevé equations and the Garnier system in two variables. This result provides a new perspective on the relationship between autonomous integrable P$\Delta$Es and Painlevé-type dynamics.
Read the full abstract
Dynamical Systems
Kernel-Based LMI Approaches to Solving the Hamilton-Jacobi-Bellman Equation and Nonlinear Optimal Control
We present a kernel-based linear matrix inequality (LMI) approach for the approximate solution of Hamilton–Jacobi–Bellman (HJB) equations arising in nonlinear optimal control. The method represents the gradient of the value function in a reproducing kernel Hilbert space (RKHS) and uses a Schur-complement reformulation to convert the quadratic HJB inequality into an LMI that is linear in the kernel coefficients, yielding a convex semidefinite program. The novel ingredient is an explicit Riccati–Hessian equality constraint at the equilibrium, which removes the trivial solution and forces the Hessian of the approximation to match the algebraic Riccati equation solution of the linearised system. We give a suboptimality bound $J(x_0;\hat u) - V^*(x_0)\le \varepsilon\,T(x_0)$ in which $T(x_0)$ depends only on the problem data and the working domain (not on the approximation), and an RKHS approximation rate. Numerical experiments on a corrected 1D polynomial benchmark and on the Van der Pol oscillator measure $\varepsilon$, the RKHS approximation error, and the closed-loop cost $J(x_0;\hat u)$ versus the optimal value $V^*(x_0)$. On the 1D problem with $V^*$ in the polynomial-kernel RKHS the method recovers $V^*$ to within $3\times10^{-7}$ and achieves $0.000\%$ suboptimality. On Van der Pol it achieves the smallest HJB residual ($\varepsilon\approx 2.62$) of any method tested, beats LQR on every initial condition, and is within $0.42\%$ of the best per-IC cost (Albrekht order 6). When $V^*$ is not in the chosen RKHS, the method degrades gracefully: residuals stop improving with more centres but suboptimality remains bounded ($\le 13\%$ on the 1D test).
Read the full abstract
Geometric Topology
Affine transverse foliations in sphere bundles
Let~$S^{n-1}\rightarrow E \rightarrow M^n$ be an oriented sphere bundle supporting a {smooth} affine transverse foliation. We give a new and elementary proof of the following fact: if the fundamental group {$\pi_1(M^n)$} is amenable, then the Euler number of the bundle vanishes. As a by-product, we give an upper bound for the Euler number of the bundle in the general case, that is, for non-amenable {$\pi_1(M^n)$}.
Read the full abstract
Analysis of PDEs
Existence thresholds and limit profiles of ground states for lower critical Choquard equations with general nonlinearities
In this paper, we study the existence, non-existence and asymptotic behavior of positive ground states for the nonlinear Choquard equation: \begin{equation}\label{0.1} -\Delta u+\varepsilon u=\big(I_{\alpha}\ast F(u)\big)F'(u),\quad u\in H^1(\mathbb R^N), \end{equation} where $F(u)=|u|^{\frac{N+\alpha}{N}}+G(u)$ with $G(u)=\int_0^ug(s)ds$, $N\geq3$ is an integer, $I_{\alpha}$ is the Riesz potential of order $\alpha\in(0,N)$ and $\varepsilon>0$ is a frequency parameter. Under some mild subcritical growth assumptions on $g\in C([0,\infty), [0,\infty))$, we establish a sharp threshold result for the existence of ground states, and an asymptotic characterization of the ground state solutions as $\varepsilon\to 0$. In particular, if $g(s)\sim s^{q-1}$ as $s\to 0$ for some $q\in (\frac{N+\alpha}{N}, \frac{N+\alpha}{N-2})$, then if $q<\frac{N+\alpha+4}{N}$, \eqref{0.1} admits a ground state for all $\varepsilon>0$, and if $q\ge \frac{N+\alpha+4}{N}$, then a threshold phenomena occur: there exists $\varepsilon_q>0$ such that \eqref{0.1} has no ground state for $\varepsilon\in (0,\varepsilon_q)$ and admits a ground state for $\varepsilon>\varepsilon_q$. If $g(s)\simeq as^{q-1}$ as $s\to 0$ for some $a>0$ and $q\in (\frac{N+\alpha}{N}, \min\{\frac{N+\alpha}{N-2}, \frac{N+\alpha+4}{N}\})$, we show that as $\varepsilon \to 0$, the ground state solutions of \eqref{0.1}, after a suitable rescaling, converges in $H^1(\mathbb R^N)$ to a particular solution of the Hardy-Littlewood-Sobolev critical equation $u=\frac{N+\alpha}{N}(I_{\alpha}*|u|^{\frac{N+\alpha}{N}})|u|^{\frac{N+\alpha}{N}-2}u$. It turns out that the limit profiles are determined solely by the locations of $(a,q)$ in $(0,+\infty)\times (\frac{N+\alpha}{N}, \min\{\frac{N+\alpha}{N-2}, \frac{N+\alpha+4}{N}\})$. We also establish a novel sharp asymptotic characterization of such a rescaling.
Read the full abstract
Dynamical Systems
Kernel Methods for Stochastic Dynamical Systems with Application to Koopman Eigenfunctions: Feynman-Kac Representations and RKHS Approximation
We extend the unified kernel framework for transport equations and Koopman eigenfunctions, developed in previous work by the authors for deterministic systems, to stochastic differential equations (SDEs). In the deterministic setting, three analytically grounded constructions-Lions-type variational principles, Green's function convolution, and resolvent operators along characteristic flows–were shown to yield identical reproducing kernels. For stochastic systems, the Koopman generator includes a second-order diffusion term, transforming the first-order hyperbolic transport equation into a second-order elliptic-parabolic PDE. This fundamental change necessitates replacing the method of characteristics with probabilistic representations based on the Feynman–Kac formula. Our main contributions include: (i) extension of all three kernel constructions to stochastic systems via Feynman–Kac path-integral representations; (ii) proof of kernel equivalence under uniform ellipticity assumptions; (iii) a collocation-based computational framework incorporating second-order differential operators; (iv) error bounds separating RKHS approximation error from Monte Carlo sampling error; (v) analysis of how diffusion affects numerical conditioning; and (vi) connections to generator EDMD, diffusion maps, and kernel analog forecasting. Numerical experiments on Ornstein–Uhlenbeck processes, nonlinear SDEs with varying diffusion strength, and multi-dimensional systems validate the theoretical developments and demonstrate that moderate diffusion can improve numerical stability through elliptic regularization.
Read the full abstract
Optimization and Control
Feasible Pairings for Decentralized Integral Controllability of Non-Square Systems
This paper investigates the determination of feasible input-output pairings for the decentralized integral controllability of non-square systems. The relevance of this problem extends beyond traditional industrial processes into modern AI research, particularly Multi-Agent Reinforcement Learning (MARL), where environments frequently act as strongly non-square mappings that evaluate high-dimensional joint action spaces via comparatively low-dimensional global rewards. To address the stability of these complex distributed architectures, we extend the concept of D-stability to non-square matrices, providing a crucial mathematical foundation. We formally define D-stability for non-square matrices as a direct generalization of the square case. By introducing the concept of “Squared Matrices”, which are derived from specific column selections of the non-square formulation and directly correspond to candidate control pairings, we establish a fundamental link between the stability of these square sub-components and the original non-square system. Ultimately, we propose sufficient conditions under which the individual Volterra-Lyapunov stability of these squared components guarantees the extended D-stability of the non-square matrix, thereby providing a rigorous method to identify feasible pairings that ensure robust decentralized control across both classical and data-driven applications.
Read the full abstract
Numerical Analysis · Cross-listed from cs.AR
SHIELD8-UAV: Sequential 8-bit Hardware Implementation of a Precision-Aware 1D-F-CNN for Low-Energy UAV Acoustic Detection and Temporal Tracking
Real-time unmanned aerial vehicle (UAV) acoustic detection at the edge demands low-latency inference under strict power and hardware limits. This paper presents SHIELD8-UAV, a sequential 8-bit hardware implementation of a precision-aware 1D feature-driven CNN (1D-F-CNN) accelerator for continuous acoustic monitoring. The design performs layer-wise execution on a shared multi-precision datapath, eliminating the need for replicated processing elements. A layer-sensitivity quantisation framework supports FP32, BF16, INT8, and FXP8 modes, while structured channel pruning reduces the flattened feature dimension from 35,072 to 8,704 (75%), thereby lowering serialised dense-layer cycles. The model achieves 89.91% detection accuracy in FP32 with less than 2.5% degradation in 8-bit modes. The accelerator uses 2,268 LUTs and 0.94 W power with 116 ms end-to-end latency, achieving 37.8% and 49.6% latency reduction compared with QuantMAC and LPRE, respectively, on a Pynq-Z2 FPGA, and 5-9% lower logic usage than parallel designs. ASIC synthesis in UMC 40 nm technology shows a maximum operating frequency of 1.56 GHz, 3.29 mm2 core area, and 1.65 W total power. These results demonstrate that sequential execution combined with precision-aware quantisation and serialisation-aware pruning enables practical low-energy edge inference without relying on massive parallelism.
Read the full abstract
Differential Geometry
The Anisotropic Capillary $L_p$-Minkowski Problem
This paper introduces the \textit{anisotropic $\omega_0$-capillary $p$-sum} of two hypersurfaces in $\mathbb{R}_+^{n+1}$, and establishes a theory for anisotropic capillary convex bodies. For a smooth convex hypersurface $\Sigma $ with anisotropic $\omega_0$-capillary boundary, we compute the variation of its anisotropic capillary $k$-th quermassintegral via this $p$-sum, thereby defining the associated anisotropic $\omega_0$-capillary $k$-th $p$-surface area measure on the capillary Wulff shape $\mathcal{C}_{\omega_{0}}$. This motivates us to propose and solve the anisotropic capillary $L_{p}$-Minkowski problem for $p\geq1$.
Read the full abstract
Algebraic Geometry
2–elementary rational covers of the plane
In this paper I classify, up to Cremona transformations, the Galois cover of the plane with Galois group of the form $\mathbb Z_2^r$.
Category Theory · Cross-listed from cs.LO
A Classifying Topos for the Spectrum of Equivalences
What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying toposes coincide. Process algebra answers with the linear time-branching time spectrum of van Glabbeek: a hierarchy of behavioral equivalences from trace equivalence to bisimilarity, each determined by which observations can distinguish processes. We show these are aspects of a single structure in which behavioral abstraction is localization. Each labeled transition system receives a geometric theory $\mathbb{T}_M$ whose classifying topos $\mathcal{E}[\mathbb{T}_M]$ determines its provable geometric sequents. Mutual simulation is strictly coarser than bisimulation, strictly coarser than topos equivalence; diamond-only Hennessy-Milner logic characterizes the bisimulation-invariant fragment of geometric logic – a geometric van Benthem theorem. Grothendieck topologies yield $J_{\mathrm{bisim}} \subsetneq J_{\mathrm{sim}} \subsetneq J_{\mathrm{trace}}$, constructive for trace and bisimulation; a counterexample shows the observation-class approach inadequate for simulation, motivating Caramello's duality. Energy-topology extends this to all 13 named equivalences. Lattice closure yields 30 elements including 17 unnamed hybrids absent because the energy-game framework computes but does not close. $L_{30}$ is indecomposable with $S \to F = \mathrm{IF}$; a Geometric Closure Theorem computes presheaf Heyting implications at a single free extension. The hierarchy, bi-Heyting structure, and Closure Theorem are proved constructively with no known process-algebraic proof. The spectrum is a finite sub-poset of an infinite coframe whose operations (meets, implications, subtractions) yield structure inaccessible from process algebra. Formalized in Lean 4/Mathlib.
Read the full abstract
Information Theory
Non-Existence of Some Function-Correcting Codes With Data Protection
In this paper, we consider the recently introduced concept of function-correcting codes (FCCs) with data protection, which provide a certain level of error protection for the data and a higher level of protection for a desired function on the data. These codes are denoted by $(f\!:\!d_d,d_f)$-FCC, where $d_d$ is the minimum distance of the code and $d_f$ denotes the minimum distance between those codewords that correspond to different function values of a function $f:\mathbb{F}_q^k \to \mathrm{Im}(f)$, with $d_f \geq d_d$. We use a distance graph on a code based on the pairwise distances of its codewords, and show conditions under which a code cannot work as a strict $(f\!:\!d_d,d_f)$-FCC, that is, code for which $d_f > d_d$. We then consider some well-known classes of codes, such as perfect codes and maximum distance separable (MDS) codes, and show that they cannot be used as strict $(f\!:\!d_d,d_f)$-FCCs.
Read the full abstract
Functional Analysis
Operator symmetric moduli and sharp triangle inequalities
We compare the usual operator modulus with two symmetrized variants, the arithmetic symmetric modulus and the quadratic symmetric modulus. For every unitarily invariant norm, we determine sharp equivalence constants among these three moduli. We also establish sharp triangle-type inequalities for unitarily invariant norms, controlling sums of matrices by sums of symmetrized moduli, including optimal Schatten $p$-norm bounds and a phase transition phenomenon for the quadratic version. Explicit low-dimensional examples are provided to show that the constants are best possible. In particular, we answer two questions posed by Bourin and Lee in \cite{BL26b}.
Read the full abstract
Analysis of PDEs
The derivative of the fractional discrete Laplacian is an exotic Riesz potential
Let $\Delta_{N}$ be the multidimensional discrete Laplacian on $\mathbb{Z}^N$ ($N\ge1$). In this note, we prove that, when $N=1$, the right hand derivative of $(-\Delta_1)^s$ at $0$ is an exotic discrete Riesz potential (namely, the endpoint case: the order is 0) in Stein-Wainger sense (J. Anal. Math. 2000), and when $N\ge 2$, the corresponding derivative is also an exotic discrete Riesz potential with an additional corrector. A similar conclusion for the left hand derivative case is also considered. All results obtained in this note extend the logarithmic Laplacian of Chen-Weth (Comm. PDEs. 2019) to the discrete setting.