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)

Tuesday 28 April

Optimization and Control · Cross-listed from cs.LG

Observable Neural ODEs for Identifiable Causal Forecasting in Continuous Time

Causal inference in continuous-time sequential decision problems is challenged by hidden confounding and partially observed states. We show that, under explicit structural assumptions, observability of the latent state enables identification of dynamic treatment effects through a continuous-time conditional front-door adjustment, even in the presence of hidden confounding. We derive a general adjustment formula and show that it reduces to a tractable state-space formula when unobserved contemporaneous disturbances are temporally uncorrelated. This formula expresses potential-outcome distributions under alternative treatment trajectories through the measurement model, latent dynamics, and the filtering distribution over latent states. We propose Observable Neural ODEs (ObsNODEs), Neural ODE models in observable normal form that implement this tractable adjustment for causal forecasting. ObsNODEs learn continuous-time dynamics with states reconstructible from observations, enabling outcome prediction under alternative treatment paths. Experiments on synthetic, semi-synthetic, and real-world clinical data demonstrate strong performance over recent sequence models, including external validation.
Read the full abstract

Statistics Theory

Estimating the tail index of Pareto-type distributions from geometric records

In this paper, we develop a novel inferential approach based on geometric records for estimating the tail index of heavy-tailed distributions. We construct a maximum likelihood estimator for the Pareto model and establish strong consistency and asymptotic normality, providing also an explicit expression for the asymptotic variance. These results are then extended to a broad class of Pareto-type distributions. The performance of the estimator is assessed via Monte Carlo simulation and compared with classical estimators from the literature. The proposed method is particularly well suited for settings where data arrive sequentially, as it yields smooth estimation trajectories. It is also especially advantageous in applications such as destructive testing, where measuring each item is costly. In this context, the estimator achieves a comparable level of estimation accuracy to Hill's estimator, but with a considerably lower number of fully measured items. An application to the analysis of the distribution of fluctuations of the Dow Jones Industrial Average (DJI) is also presented.
Read the full abstract

All authors Martín Alcalde, Raúl Gouet, Miguel Lafuente, F. Javier López, Gerardo Sanz

Numerical Analysis

On weak greedy algorithms

The main goal of this paper is twofold. First, we extend some results known in the case of weak greedy algorithms with a scalar parameter to the case of weak greedy algorithms with a weakness sequence. Second, we formulate a new setting of the problem of convergence of greedy algorithms. Usually, we are interested in convergence of an algorithm for all elements of the space. We suggest to study convergence of an algorithm for a subset, which is a generalized octahedron associated with a given dictionary.
Read the full abstract

Dynamical Systems

Limit cycles in piecewise smooth systems with circular switching manifold

We study limit cycles in piecewise complex systems with switching manifold $\mathbb{S}^1$. Using Möbius transformations we establish an equivalence between circular and straight-line discontinuities that preserves periods, stability, and algebraic structure. For piecewise polynomial holomorphic systems we obtain lower bounds on the number of limit cycles via second-order averaging and, for low degrees, via Lyapunov quantities. For piecewise antiholomorphic systems we prove upper bounds: at most $3$ limit cycles in the linear case and $10$ in the quadratic case. We also prove a rigidity theorem: when both components admit classical holomorphic normal forms at the origin no crossing limit cycles exist. Finally, we construct explicit algebraic limit cycles in the circular context, providing, as far as we know the first such examples in the literature.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.PE

The Curse of Black Sigatoka: A Backward Bifurcation Perspective

Black Sigatoka disease (BSD), also known as black leaf streak disease, is an airborne fungal infection caused by Pseudocercospora fijiensis that severely impacts global banana and plantain production. Its persistence and resistance to eradication make it one of the most challenging plant diseases to manage. In this paper, we propose a deterministic pathogen-host model to describe BSD dynamics. Due to dual transmission pathways (ascospores and conidia) and mate limitation in sexual reproduction, the model exhibits a backward bifurcation: a stable endemic equilibrium coexists with the disease-free equilibrium for certain parameter values in which the basic reproduction number, $\mathcal{R}_0$, is less than 1. This phenomenon explains why control strategies that solely reduce $\mathcal{R}_0$ below one may fail. For the backward bifurcation regime, we perform sensitivity analysis of the endemic equilibrium using normalized forward sensitivity indices, Latin Hypercube Sampling, and Partial Rank Correlation Coefficients. Results indicate that effective control must extend beyond $\mathcal{R}_0$ reduction and prioritize (1) limiting production of new susceptible leaves during high-risk periods and (2) developing and deploying disease-resistant plant varieties. To incorporate transmission variability, we also formulate a stochastic version of the model using the Stochastic Simulation Algorithm (SSA). Extensive numerical simulations compare stochastic realizations with deterministic predictions and quantify variability in disease dynamics. To identify the principal drivers of persistence and variability, we analyze the endemic equilibrium using Sobol's variance-based sensitivity method, which highlights the role of nonlinear parameter interactions in shaping variability.
Read the full abstract

Commutative Algebra

On $S$-Noetherian Lattices

In this paper, we define and study $S$-Noetherian lattices as a natural generalization of Noetherian rings. We prove that a ring $R$ is $S$-Noetherian if and only if its ideal lattice, $Id(R)$, is $S_L$-Noetherian. Furthermore, we establish a Cohen-Kaplansky type theorem for $S$-Noetherian lattices, showing that $L$ is $S$-Noetherian if and only if every $S$-prime element of $L$ is $S$-compact. Finally, we introduce the concept of $S$-primary elements - a generalization of primary elements in multiplicative lattices and demonstrate the existence (when every element of $S$ is meet principal, as is the case for the ideal lattice of a ring) and uniqueness of $S$-primary decomposition in $S$-Noetherian lattices.
Read the full abstract

2604.26058 · 28 Apr · The authors thank Professor Akiyoshi Sannai of Kyoto University for identifying a gap in the earlier version of Theorem 2.15, implication $(3) \implies (4)$, using AI Math Referee, a mathematical auditing tool under development by him. The Second S-Uniqueness Theorem has also been established, along with several additional results

Algebraic Geometry

Some local and global properties of secant varieties of nonsingular projective curves

The main goal of this paper is to study some local and global properties of secant varieties of algebraic curves. These results complement our previous work [8] by addressing issues given therein and providing solutions to problems raised subsequently. Specifically, we show a description of tangent cones of secant varieties of curves, and compute the cohomology groups of secant sheaves on symmetric products of curves, which answers a question posed in [8] and leads to a recursive formula for Hilbert polynomials of secant varieties of curves. In the appendix, we present a cohomological approach to arithmetical Cohen–Macaulayness of secant varieties of curves, completing the proof in [8].
Read the full abstract

Numerical Analysis

Discrete variational calculus for double-bracket dissipation

Discrete variational methods show excellent performance in numerical simulations of mechanical systems. In this paper, we adapt discrete variational integrators for the case of mechanical systems with double-bracket dissipation. In particular, we will work with forced Euler-Poincaré and forced Lie-Poisson systems, and the case of interest for us will be when the coadjoint orbits remain invariant, but the energy is decreasing along the orbit. This particular kind of dissipative system appears in various physical systems such as satellites with dampers, geophysical fluids, plasma physics and stellar dynamics. The proposed geometric integrator preserves the coadjoint orbits exactly. We highlight the advantages of this feature by comparing it with other general-purpose methods (including higher-order ones) across different numerical simulations.
Read the full abstract

All authors Anthony Bloch, Sebastián J. Ferraro, David Martín de Diego, Shreyas Bharadwaj

Functional Analysis

Non-stable subnormal contractions have nontrivial hyperinvariant subspaces

A contraction $T$ on a (complex, separable) Hilbert space is stable, or of class $C_{0\cdot}$, if $T^n\to 0$ in the strong operator topology. It is proved that for a non-stable pure subnormal contraction $T$ there exists a singular inner function $\theta$ such that the range of $\theta(T)$ is not dense. Consequently, $T$ has nontrivial hyperinvariant subspaces. The proof is based on results by Esterle and Kérchy. Examples of stable subnormal contractions are given for which the range of $\varphi(T)$ is dense for every $\varphi\in H^\infty$ ($\varphi\not\equiv 0$).
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

A semiparametric autorregresive spatial prediction model

In this paper we propose a semiparametric spatial autoregressive model that combines a linear covariate component with a nonparametrically estimated spatial term, allowing flexible dependence modeling without restrictive covariance structure while preserving interpretability. We establish asymptotic properties, including consistency and asymptotic normality, and evaluate performance through simulations and real data. Results show competitive predictive accuracy relative to geostatistical methods and improved interpretability compared to spatial econometric models.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

The Super Virasoro Minimal String from 3d Supergravity

The super Virasoro minimal string is defined by coupling spacelike and timelike super Liouville theories on the worldsheet. There are four different theories 0A$^\pm$ and 0B$^\pm$ depending on discrete choices on the worldsheet. We show that these theories arise naturally from quantization of 3d supergravity, and the amplitudes compute the dimension ($+$) or superdimension ($-$) of the space of $\mathcal{N}=1$ superconformal blocks modulo crossing symmetry. Both 0A$^+$ and 0B$^+$ are perturbatively dual to the same matrix integral as the bosonic Virasoro minimal string, while 0B$^-$ is dual to a matrix integral with an inverse square root singularity. We show that all non-trivial perturbative amplitudes of the 0A$^-$ theory vanish.
Read the full abstract

Metric Geometry

Conic locus of inversive Poncelet circumcenter and two points of invariant circle power

We prove that over a generic Poncelet triangle family, the locus of the circumcenter of an inversive triangle is a conic. Additionally, we prove an earlier conjecture: over generic Poncelet triangles, two unique points exist which maintain constant power with respect to the circumcircle and Euler's circle of the family, respectively.
Read the full abstract

Metric Geometry

Euclidean distance geometry and the orthogonal beltway problem

The orthogonal beltway problem is the problem of recovering the $\mathrm{O}(n)$-orbit of a $\delta$-function supported at a finite number of points in $\r^n$ from its auto-correlation or, equivalently, second moment. It was introduced as a generalization of the classical beltway problem in X-ray crystallography and was motivated by cryo-electron microscopy. In this paper we prove that if $m > n$, then the $\mathrm{O}(n)$-orbit of generic binary signal supported at $m$ points where at least $\ell$ of them have equal magnitude can be recovered from its auto-correlation. We also provide a connection to Euclidean distance geometry and prove, as a corollary of our main theorem, that if $m > n$, then the $\mathrm{O}(n)$-orbit of a generic collection of $m$ points on the sphere $S^{n-1}$ can be recovered from their unlabeled interpoint distances. We take advantage of the parallels to Euclidean distance geometry and develop a polynomial-time reconstruction algorithm for recovering the $\O(n)$-orbits of binary $\delta$-functions from their second-moment data when at least one of the points has distinct magnitude. In $\mathbb{R}^3$, the complexity of our algorithm is bounded from above by $O(m^8)$ but we show that in practice the complexity is much lower. We also demonstrate that the algorithm is robust to low levels of noise. Finally, we extend our algorithm to successfully perform recovery when all the support vectors lie on a common sphere, and in this case we match the time complexity of $O(m^8)$.
Read the full abstract

Probability

Stochastic Ordering of Dependent Systems under Transformation Models and Archimedean Copulas

We study stochastic ordering of system lifetimes with dependent and heterogeneous components whose marginal distributions are obtained through transformations of a common baseline. The dependence structure is modeled via Archimedean copulas, allowing for a unified treatment of several transformation-based models, including proportional hazard, proportional reversed hazard rate and proportional odds families. For parallel, series and $(n-k)$-out-of-$n$ systems, we derive conditions for stochastic dominance based on monotonicity of the transformation and structural properties of the copula generators, formulated through super-additivity and Schur-type arguments. The results provide tractable criteria that extend existing comparisons beyond independence and illustrate the combined effect of dependence and parameter heterogeneity on system reliability.
Read the full abstract

Optimization and Control

A PDE approach to Benamou–Brenier formula for the Schrödinger problem

We studied the Benamou–Brenier formulation of the Schrödinger problem, focusing on a gap between theoretical results and applications, that often involve measures with unbounded support. While the existing proof in the literature relies on the compactness of the marginals' supports to ensure the necessary regularity of the Schrödinger potentials, we extend the validity of the Benamou–Brenier formula to the larger class of sub-Gaussian probability measures. Exploiting fine estimates on the Hessian of the potentials and the entropic interpolation, we provide an almost self-contained proof that establishes the existence of a velocity field with the appropriate polynomial growth that ensures the right integrability. This result justifies the use of the dynamic formulation in more general settings, such as Gaussian and mixture-of-Gaussians models, important also for the applications.
Read the full abstract

All authors Mattia Garatti, Luca Nenna, Simona Rota Nodari, Luca Tamanini

Mathematical Physics · Cross-listed from hep-th

The Schrodinger Equation as a Gauge Theory

The conserved probability current of the Schrodinger field admits a dimension-dependent gauge representation that provides a convenient setting for comparing hydrodynamic, topological and infrared structures. We use this representation to develop a unified treatment of several deformations of the Madelung momentum. BF couplings incorporate electromagnetic interactions, Berry and spin connections, projected non-abelian adiabatic data, and intrinsic phase holonomy within the same framework. In $(2+1)$ dimensions, the Chern-Simons deformation can be reduced to a nonlocal functional of the wavefunction. Its Coulomb-gauge form separates into a phase-sensitive geometric contribution and a density-dependent dynamical contribution; we show explicitly how this separation changes under a general gauge transformation and recover the topological braiding phase in the well-separated adiabatic regime. For systems with a spatial boundary, we derive the equal-time symplectic structure, the associated surface charges, and their boundary algebra. Finally, after a nonlinear interaction produces the Bogoliubov acoustic branch, the radiative memory can be expressed in the dual two-form variables. Its zero-average component is generated by a residual large gauge transformation, whereas the monopole component remains independent global data. This provides a gauge-theoretic description of the memory/asymptotic-symmetry sector of the acoustic infrared structure.
Read the full abstract

Algebraic Geometry

Cut and paste invariants of moduli spaces of stable maps to toric surfaces

We study moduli spaces of logarithmic stable maps to proper toric surfaces with prescribed tangency conditions to the toric boundary. Fixing a surface, we define a chamber decomposition on the space of all tangencies such that as a function of the tangency data, the class of the corresponding moduli space in the Grothendieck ring of varieties is constant. The tangency data defines a collection of lines through the origin which, along with the rays of the toric fan, are cyclically ordered. The chambers of the decomposition are regions for which this cyclic ordering is constant and generalise the well-known resonance chambers. We pose the open question of whether the Gromov-Witten invariants of the moduli spaces are polynomial on these chambers.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Lattice Topological Defects in Non-Unitary Conformal Field Theories

Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing ab-initio analytical and numerical computations of their characteristics. In this work, topological defects are investigated in non-unitary conformal field theories using appropriate variations of the restricted solid-on-solid models. The relevant impurity models and the corresponding defect operators are constructed for the lattice system. Numerical computations are performed for the energy spectrum, eigenvalues of the defect operators as well as thermodynamic characteristics and compared with analytical predictions. Finally, renormalization group flows between the different fixed points are analyzed using numerical methods.
Read the full abstract

All authors Madhav Sinha, Thiago Silva Tavares, Hubert Saleur, Ananda Roy

Information Theory

Lightweight Quantum Agent for Edge Systems: Joint PQC and NOMA Resource Allocation

In the context of quantum secure scenarios, existing research on mobile edge devices and intelligent computing and edge (ICE) systems based on the Non-Orthogonal Multiple Access (NOMA) communication model have overlooked the energy consumption overhead of Post-Quantum Cryptography (PQC) modules, and the high complexity of traditional resource allocation algorithms fails to meet the demands of real-time decision-making. To address these challenges, this paper proposes a lightweight agentic AI framework designed for online joint optimization within ICE-enabled mobile devices. The scheme constructs a multi-stage stochastic Mixed Integer Nonlinear Programming (MINLP) model that incorporates static power-consumption constraints for PQC modules. Based on Lyapunov optimization theory, the long-term optimization problem is decoupled, and a linear complexity algorithm is proposed to solve the nonconvex challenges of NOMA power allocation . Simulation results verify that the proposed scheme significantly improves computational throughput while ensuring system queue stability and energy consumption constraints. Compared with traditional Successive Convex Approximation (SCA) algorithms, the complexity is reduced to $\mathcal{O}(N)$, achieving a speedup of approximately 46 times when the number of devices $N=35$, thereby meeting the real-time decision-making requirements in dynamic wireless environments.
Read the full abstract

All authors Yongtao Yao, Wenjing Xiao, Miaojiang Chen, Anfeng Liu, Zhiquan Liu, Min Chen, Ahmed Farouk, H. Herbert Song

Information Theory · Cross-listed from cs.LG

Rethinking KV Cache Eviction via a Unified Information-Theoretic Objective

Key-Value (KV) caching is essential for large language model inference, yet its memory overhead poses a critical bottleneck for long-context generation. Existing eviction policies predominantly rely on empirical heuristics, lacking a rigorous theoretical foundation. This work rethinks KV cache eviction through the lens of the Information Bottleneck principle. Under a linear-Gaussian surrogate of attention, we derive a closed-form mutual information objective that characterizes the effective information capacity of a retained KV cache subset. This formulation reveals that a wide range of existing eviction strategies can be interpreted as different approximations of the same capacity-maximization principle. Guided by this insight, we introduce CapKV, a capacity-aware eviction method that directly targets information preservation via a log-determinant approximation using statistical leverage scores. This approach replaces heuristic selection with a theoretically grounded mechanism that preserves the maximum predictive signal. Extensive experiments across multiple models and long-context benchmarks show that CapKV consistently outperforms prior methods, achieving a better trade-off between memory efficiency and generational fidelity. Our code is available at https://github.com/jiamingyy/CapKV
Read the full abstract

All authors Jiaming Yang, Chenwei Tang, Liangli Zhen, Jiancheng Lv

Information Theory · Cross-listed from cs.RO

Multi-Periodogram Velocity Estimation with Irregular Reference Signals for Robot-Aided ISAC

This paper addresses velocity estimation within robot-aided integrated sensing and communications (ISAC), where mobile robots act as sensing nodes but can only opportunistically reuse irregular 5G/6G reference signals (RSs). We show that the velocity profile induced by such irregular time-domain patterns can be decomposed into a periodic-peak component and an amplitude-shaping (weighting) component. Leveraging this structure, we propose a multi-periodogram velocity estimation algorithm that is standard-compliant and does not require new sensing-dedicated RSs or 3GPP modifications. Simulation results demonstrate that, compared with conventional periodogram processing, the proposed method improves low-SNR robustness by achieving a 3 dB SNR gain at the 10% missed-detection rate and reducing false alarms by 51%.
Read the full abstract

All authors Yi Geng, Pan Cao, Ting Zeng, Yongqian Deng

General Mathematics

A Pépin-Type Characterization for Fermat Pseudoprimes

Pépin's primality test asserts that, for $n\ge2$, \[ 3^{(F_n-1)/2}\equiv -1 \pmod{F_n} \] if and only if $F_n$ is prime. We establish a natural analogue of Pépin's criterion for pseudoprimality. More precisely, we prove that, for \mbox{$n\ge5$,} \[ 3^{(F_n-1)/2}\equiv 1 \pmod{F_n} \] if and only if $F_n$ is pseudoprime to the base $3$.
Read the full abstract

General Mathematics

Right edge rates of the zeros of $\widetilde{\Xi}_n$ and $\widetilde{\Lambda}_n$

We consider the two families of even polynomials $\Xi_n$ and $\Lambda_n$ studied in~\cite{TallaWaffo2026arxiv2602.16761}, together with the rescaled polynomials $\widetilde{\Xi}_n(x):=\Xi_n(\sqrt{x})$ and $\widetilde{\Lambda}_n(x):=\Lambda_n(\sqrt{x})$, $n\ge2$. Their zeros are real, simple, and contained in $(0,1)$. Writing them as $0<x^{(\Xi)}_{1,n}<\cdots<x^{(\Xi)}_{n-1,n}<1$ and $0<x^{(\Lambda)}_{1,n}<\cdots<x^{(\Lambda)}_{n-1,n}<1$, we study the asymptotic behaviour of the largest zeros $x^{(\Xi)}_{n-1,n}$ and $x^{(\Lambda)}_{n-1,n}$. We prove that the two families have different exponential rates at the right endpoint: \[ \frac{1}{n-1}\log\bigl(1-x^{(\Lambda)}_{n-1,n}\bigr)\to-\log4, \qquad \frac{1}{n-1}\log\bigl(1-x^{(\Xi)}_{n-1,n}\bigr)\to-\log9. \] Thus, although the two families share the same global limiting zero distribution, their extreme right zeros approach $1$ on different exponential scales. The proof is based on the representation of $\Xi_n$ and $\Lambda_n$ in terms of Eulerian polynomials of type~B and type~A, respectively, and on an elementary estimate for the smallest negative zero in terms of the first non-constant coefficient.
Read the full abstract

Number Theory

The Multidimensional Bateman Horn Conjecture: Effective Estimates for the Tail of the Singular Series and an Algorithm for Computation with Guaranteed Accuracy

We propose a method for computing the leading term of the asymptotics of the multidimensional Bateman Horn conjecture for systems of integer polynomials in several variables with controlled relative accuracy. The Bateman Horn conjecture is used as an explicit assumption about the growth rate of the number of prime values, the computational difficulty is concentrated in the singular series: an infinite product over all primes. For systems of general type, we obtain a universal estimate for the tail of the singular series in terms of a geometric constant depending on the Betti numbers of projective closures of hypersurfaces. For systems whose projective closures are smooth hypersurfaces (including inhomogeneous diagonal ones), using the exact Griffiths formula for Betti numbers, we obtain an improved constant in the tail estimate. The estimates are valid for all dimensions and degrees and do not require additional restrictions on the number of variables. We establish a connection between the truncation error of the singular series and the error in computing the number of prime values: under the Bateman Horn condition, the relative error in determining the singular constant coincides with the relative error in determining the number of prime values in the asymptotic regime. Based on the obtained estimates, we develop an algorithm for computing the leading term of the asymptotics with prescribed accuracy, classifying the system by its structure and producing a guaranteed interval for the number of prime values. Numerical experiments confirm the theory.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Principal Component Based Estimation of Finite Population Mean under Multicollinearity

Auxiliary information is frequently utilized in survey sampling to improve the efficiency of estimators of the finite population mean. However, the simultaneous use of multiple auxiliary variables often induces multicollinearity, which adversely affects the stability and performance of conventional estimators. To address this issue, the present study proposes a principal component analysis (PCA) based estimation approach for the finite population mean in the presence of multicollinearity between two auxiliary variables. The proposed methodology transforms the correlated auxiliary variables into a set of orthogonal principal components, thereby removing the effect of multicollinearity while preserving the essential information contained in the auxiliary variables. An efficient estimator is then constructed using these components under simple random sampling without replacement. The bias and mean square error (MSE) of the proposed estimator are derived up to the first order of approximation. The performance of the proposed estimator is evaluated through both empirical and simulation studies under varying correlation structures. Moreover, the presence of multicollinearity is evaluated using variance inflation factors, condition indices, and eigenvalues. The results from empirical and simulation studies demonstrate that the proposed PCA-based estimator outperforms several conventional estimators in terms of MSE and percentage relative efficiency (PRE) when multicollinearity exists, ensuring robust and efficient estimation of the population mean.
Read the full abstract

Probability

Strong convergence rate of Euler-Maruyama approximations in temporal-spatial Hölder-norms for Lévy-driven stochastic differential equations

We study the error between the exact solution and its Euler-Maruyama approximation in temporal-spatial Hölder-norms for Lévy-driven stochastic differential equations.

Combinatorics

Permutations that strongly avoid 132

A permutation $\pi$ strongly avoids the pattern $\tau$ if both $\pi$ and $\pi^2$ avoid $\tau$. In this paper, we enumerate permutations of size $n$ that strongly avoid the pattern 132. This enumeration allows us to prove a conjecture that the growth rate of such permutations is 2.
Read the full abstract

Optimization and Control

$H^2$ Stabilization of the $2$-D and $3$-D Heat Equation via Modal Decomposition

Modal decomposition has been used recently to achieve boundary stabilization of linear parabolic equations in the $H^1$ norm, in two and three dimensions. In one dimension, $H^1$ exponential stability is well established and known to imply boundedness and asymptotic convergence of the state's max norm to zero. However, this implication does not necessarily hold in higher dimensions. In this paper, we prove that the modal-decomposition-based full-state feedback controller in \cite{Munteanu2017IJC} guarantees, not only $H^1$ exponential stability, but also $H^2$ exponential stability, which implies boundedness and asymptotic convergence of the state's max norm to zero. Our approach is based on rewriting the state's Laplacian, required in the expression of the state's $H^2$ norm, as a linear combination of the state and its time derivative. Thereby, the $L^2$ norm of the state's time derivative is the one to be analyzed in terms of boundedness and asymptotic convergence to zero.
Read the full abstract

All authors Mohamed Amine Ouchdiri, Mohamed-Camil Belhadjoudja, Mohamed Maghenem, Saad Benjelloun, Adnane Saoud