English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

An n dimensional monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamical system with the property that each of the n component functions is a monic nonzero monomial function in n variables. In this paper we provide an algebraic and graph theoretic framework to study the dynamic properties of monomial dynamical systems over a finite field. Within this framework, characterization theorems for fixed point systems (systems in which all trajectories end in steady states) are proved. In particular, we present an algorithm of polynomial complexity to test whether a given monomial dynamical system over a finite field is a fixed point system. Furthermore, theorems that complement previous work are presented and alternative proofs to previous results are supplied.

An Algebraic and Graph Theoretic Framework to Study Monomial Dynamical Systems over a Finite Field