A control theory for Boolean monomial dynamical systems (Q5962028)

From MaRDI portal
Revision as of 04:57, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5786412
Language Label Description Also known as
English
A control theory for Boolean monomial dynamical systems
scientific article; zbMATH DE number 5786412

    Statements

    A control theory for Boolean monomial dynamical systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    A monomial boolean dynamical system is a map \(f:\mathbb F_2^n\to\mathbb F_2^n\) given by \(n\) monomials \(f_1,\dots,f_n\) in the \(n\) variables (with the assumption that no \(f_i\) is a constant). Here a directed graph is associated to such a map, and a result of \textit{O. Colón--Reyes} et al. [Complex Syst. 16, No. 4, 333--342 (2007; Zbl 1167.37320)] is used to characterize in graph-theoretic terms the property that \(f\) is a `fixed-point system', in which the system ends up on a fixed point. Here ideas from control theory are used to find a novel \(O(n^2\log n)\) algorithm to determine when \(f\) is a fixed-point system. These discrete dynamical systems are used in diverse areas including mathematical biology.
    0 references
    Boolean monomial dynamical system
    0 references
    fixed-point system
    0 references
    graph periodicity
    0 references

    Identifiers