Search arXivSearch

arXiv · 2506.05002

Strong stability of linear delay-difference equations

Abstract

This paper considers linear delay-difference equations, that is, equations relating the state at a given time with its past values over a given bounded interval. After providing a well-posedness result and recalling Hale--Silkowski Criterion for strong stability in the case of equations with finitely many pointwise delays, we propose a generalization of the notion of strong stability to the more general class of linear delay-difference equations with an integral term defined by a matrix-valued measure. Our main result is an extension of Melvin Criterion for the strong stability of scalar equations, showing that local and global strong stability are equivalent, and that they can be characterized in terms of the total variation of the function defining the equation. We also provide numerical illustrations of our main result.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Felipe Gonçalves Netto, Yacine Chitour, Guilherme Mazanti. 2025-06-05. Strong stability of linear delay-difference equations. https://arxiv.org/abs/2506.05002

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS