Search arXivSearch

arXiv · 2609.07407

Admissible characterization in delay equations and robustness of exponential dichotomies against small-delay perturbations

Abstract

Robustness of exponential dichotomies against small-delay perturbations presents a fundamental obstacle: the lack of an effective admissible characterization in nonautonomous delay equations. Considerable efforts have been devoted to obtaining such a characterization for differential equations in Banach spaces. However, even unlike ordinary differential equations, the variation of constants formula for delay equations requires extending the phase space to a space of discontinuous functions, and the dependence on the past states leads to another challenge in establishing exponential dichotomy via admissibility, i.e., constructing a suitable admissible pair and then estimating the growth/decay rates along the unstable/stable subspaces via the admissibility property. In this paper, we provide an admissible characterization based on two pairs of Banach spaces that yields explicit dichotomy exponents. Through this characterization and an operator perturbation method, we prove that small-delay perturbations preserve exponential dichotomies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shuang Chen, Weinian Zhang. 2026-09-07. Admissible characterization in delay equations and robustness of exponential dichotomies against small-delay perturbations. https://arxiv.org/abs/2609.07407

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

KEEP EXPLORING

Related papers

On the prime field spherical restriction conjecture in four dimensions: breaking the Stein-Tomas exponent and applications

Let $p$ be an odd prime. We prove the extension estimate $R_{S_j}^*(2\to r)\lesssim_r 1$ for every nonzero-radius sphere $S_j\subseteq\mathbb{F}_p^4$ and every $r\geq \, 34/11$, uniformly in $p$ and $j$. This improves the Stein--Tomas exponent $10/3$ established by Iosevich and Koh (2008). We also formulate a localized spherical restriction/extension conjecture that predicts the sharp dependence of the restriction norm on the size of the physical support. This conjecture implies the spherical extension estimates $R_{S_j}^*(2\to r)\lesssim_r 1$ for every $r>3$, and yields almost-every-pin distance estimates at the conjectured Erdős--Falconer exponent in four dimensions, up to an arbitrarily small power loss in the set-size hypothesis. Using the same method, we improve the bounds supplied by Fourier decay and Plancherel at intermediate support scales and derive new almost-every-pin distance estimates in $\mathbb{F}_p^4$.

math.CA

Dimension-free estimates for discrete maximal functions over cubes in $\mathbb Z^d$

In this short note, we establish dimension-free $\ell^p(\mathbb Z^d)$ bounds, for all $p\in(1,\infty]$, for the discrete Hardy--Littlewood maximal functions associated with cubes in $\mathbb Z^d$, answering a question that had been open for a while. The key idea is to prove dimension-free bounds for the $\ell^p(\mathbb Z^d)$ norms of the differences of the corresponding averages. This follows from an ad hoc interpretation of the associated discrete multipliers as a special continuous family of multipliers to which basic fractional integration and complex interpolation can be applied. The same method also yields an elementary proof of Bourgain's dimension-free $L^p(\mathbb R^d)$ bounds for the Hardy--Littlewood maximal function associated with cubes in $\mathbb R^d$.

math.CA

Establishing the Polynomial Wolff Axioms for $δ$-Separated $δ$-Tubes With #o-minimality

We establish the full version of a conjecture of Guth and Zahl, giving a lower bound for the volume of a semialgebraic set that has a large intersection with a collection of $δ$-separated $δ$-tubes. Our proof uses o-minimal methods to simplify the proof of Katz and Rogers, who proved the conjecture up to a small factor. We also establish that the constants depend polynomially on the complexity of the semialgebraic set, and more generally in the #o-minimal setting.

math.CA