Applications of Finite Fields to Dynamical Systems and Reverse Engineering Problems
From MaRDI portal
Publication:6476873
arXivmath/0603369MaRDI QIDQ6476873FDOQ6476873
Authors: Maria Alicia Aviñó Díaz, Edward L. Green, Oscar Moreno 
Publication date: 15 March 2006
Abstract: We present a mathematical model: dynamical systems over finite sets (DSF), and we show that Boolean and discrete genetic models are special cases of DFS. In this paper, we prove that a function defined over finite sets with different number of elements can be represented as a polynomial function over a finite field. Given the data of a function defined over different finite sets, we describe an algorithm to obtain all the polynomial functions associated to this data. As a consequence, all the functions defined in a regulatory network can be represented as a polynomial function in one variable or in several variables over a finite field. We apply these results to study the reverse engineering problem.
Directed graphs (digraphs), tournaments (05C20) Finite fields and commutative rings (number-theoretic aspects) (11T99)
This page was built for publication: Applications of Finite Fields to Dynamical Systems and Reverse Engineering Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6476873)
