Stabilization bounds for linear finite dynamical systems
From MaRDI portal
Abstract: A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the number of iterations needed for a system to settle on a fixed set of elements. As our main result, we present two upper bounds on iterations needed, and each one may be readily applied to a fixed point system test. The bounds are based on submodule properties of iterated images and reduced systems modulo a prime. We also provide examples where our bounds are optimal.
Recommendations
Cites work
- scientific article; zbMATH DE number 1262434 (Why is no real title available?)
- A Comprehensive Treatment of q-Calculus
- A computational algebra approach to the reverse engineering of gene regulatory networks
- Boolean monomial dynamical systems
- Counting Matrices with Coordinates in Finite Fields and of Fixed Rank.
- Cycles of linear dynamical systems over finite local rings
- Dynamics of linear systems over finite commutative rings
- Linear Finite Dynamical Systems
- Linear dynamical systems over finite rings
- Modern computer algebra
- Monomial dynamical systems over finite fields
Cited in
(6)- Linear dynamical systems over finite rings
- Linear Finite Dynamical Systems
- Finite-time stability and stabilisation with polyhedral domains for linear systems
- On the stability and instability of finite dynamical systems with prescribed interaction graphs
- A general result on the stabilization of linear systems using bounded controls
- Dynamics of linear systems over finite commutative rings
This page was built for publication: Stabilization bounds for linear finite dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663544)