Stabilization bounds for linear finite dynamical systems
From MaRDI portal
Publication:1663544
DOI10.1016/J.JALGEBRA.2018.04.009zbMATH Open1395.37066arXiv1703.10910OpenAlexW2604340356WikidataQ129989280 ScholiaQ129989280MaRDI QIDQ1663544FDOQ1663544
Publication date: 21 August 2018
Published in: Journal of Algebra (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1703.10910
Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Dynamical systems over finite ground fields (37P25) Finite commutative rings (13M99)
Cites Work
- A Comprehensive Treatment of q-Calculus
- Boolean monomial dynamical systems
- Linear Finite Dynamical Systems
- Modern computer algebra
- A computational algebra approach to the reverse engineering of gene regulatory networks
- Linear dynamical systems over finite rings
- Cycles of linear dynamical systems over finite local rings
- Title not available (Why is that?)
- Dynamics of linear systems over finite commutative rings
- Title not available (Why is that?)
- Counting Matrices with Coordinates in Finite Fields and of Fixed Rank.
Cited In (3)
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)
