Searcharxiv⌕ Search

arXiv · 2610.25327

Observability of wave equations with time- and space-dependent potentials: a counterexample under GCC and a positive criterion on the disk

Abstract

We show that the geometric control condition (GCC) for the free wave equation does not guarantee internal observability in the presence of a smooth time-dependent potential. On a bounded connected domain with analytic boundary, we construct a nonempty open observation set such that the pair satisfies GCC and the free Dirichlet wave is observable, and a smooth $2π$-periodic potential for which there exists a nonzero smooth Dirichlet wave that vanishes on the observed cylinder for all time. The wave is the unique mild solution in the space $X_Ω=L^2(Ω)\times H^{-1}(Ω)$ on every finite interval, so no finite observation horizon yields an observability inequality for this fixed potential. The construction starts from a real-valued local counterexample to unique continuation across a noncharacteristic hyperplane; this local statement is of independent interest, since earlier constructions for the wave operator use complex-valued waves and potentials. The global counterexample is obtained by joining flat oscillatory solutions along the edges of a polygonal observation set, repairing their sum at the vertices without changing its zero set, and then using a spatial transition to a common time-independent pair near the boundary. For comparison, on the unit disk we show that an observation region containing a central disk and a neighborhood of an embedded cross-cut yields observability for every weak wave at sufficiently large observation time, with constants uniform over bounded measurable potentials; the proof uses a cut, logarithmic polar coordinates, and a Carleman weight whose favorable flux is confined to the observed artificial boundary.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhonghua Liao, Qi Lü, Xu Zhang. 2026-10-18. Observability of wave equations with time- and space-dependent potentials: a counterexample under GCC and a positive criterion on the disk. https://arxiv.org/abs/2610.25327

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices

Semidefinite programming (SDP) problems are challenging to solve because of their high dimensionality. However, solving sparse SDP problems with small tree-width are known to be relatively easier because: (1) they can be decomposed into smaller multi-block SDP problems through chordal conversion; (2) they have low-rank optimal solutions. In this paper, we study more general SDP problems whose coefficient matrices have sparse plus low-rank (SPLR) structure. We develop a unified framework to convert such problems into sparse SDP problems with bounded tree-width. Based on this, we derive rank bounds for SDP problems with SPLR structure, which are tight in the worst case.

math.OC↗

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain

Learning and optimal control under robust Markov decision processes (MDPs) have received increasing attention, yet most existing theory, algorithms, and applications focus on finite-horizon or discounted models. Long-run average-reward formulations, while natural in many operations research and management contexts, remain underexplored. This is primarily because the dynamic programming foundations are technically challenging and only partially understood, with several fundamental questions remaining open. This paper steps toward a general framework for average-reward robust MDPs by analyzing the constant-gain setting. We study the average-reward robust control problem with possible information asymmetries between the controller and an S-rectangular adversary. Our analysis centers on the constant-gain robust Bellman equation, examining both the existence of solutions and their relationship to the optimal average reward. Specifically, we identify when solutions to the robust Bellman equation characterize the optimal average reward and stationary policies, and we provide one-sided weak communication conditions ensuring solutions' existence. These findings expand the dynamic programming theory for average-reward robust MDPs and lay a foundation for robust dynamic decision making under long-run average criteria in operational environments.

math.OC↗

Service-Induced Congestion in Memory-Constrained LLM Serving

In large language model (LLM) serving, each request accumulates persistent graphics processing unit (GPU) memory during service as its key-value cache grows with every generated token. Under high concurrency, aggregate memory usage therefore increases endogenously over time: the service process itself creates future capacity pressure. When memory capacity is exceeded, systems evict active requests, discarding cached state and restarting them later, which wastes computation and reduces throughput. We develop a discrete-time dynamical model of memory-constrained LLM inference that captures admission, memory growth, and eviction under continuous batching. In the saturated-input regime, the system admits both eviction-free fixed points and limit cycles with evictions. For homogeneous workloads, we show that the eviction-free equilibrium is unstable and that, except for a Lebesgue-measure-zero exact-capture set, the system converges to a unique worst-case limit cycle that is asymptotically stable outside this exceptional set, with throughput losses as large as 50%. For heterogeneous workloads, we prove a stability criterion in the two-class common-input setting and explain how the survival-polynomial mechanism generalizes to multiple classes and heterogeneous-input lengths. Under an input-dominated scaling regime, coprime decoding lengths stabilize the eviction-free equilibrium, while non-coprime lengths create synchronized modes that drive instability. These results characterize when workload heterogeneity desynchronizes completions and helps stabilize memory-constrained serving. More broadly, we identify service-induced congestion as a structural instability mechanism and derive scheduling design principles for sustaining high throughput.

math.OC↗