An algebraic and graph theoretical framework to study monomial dynamical systems over a finite field

TL;DR

This paper develops an algebraic and graph-theoretic framework to analyze monomial dynamical systems over finite fields, providing new characterization theorems and an efficient algorithm to identify fixed point systems.

Contribution

It introduces a novel algebraic and graph-based approach, including polynomial-time algorithms, for studying fixed points in monomial dynamical systems over finite fields.

Findings

Characterization theorems for fixed point systems

Polynomial complexity algorithm for fixed point detection

Alternative proofs and extended results in the theory

Abstract

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.