Applications of Finite Fields to Dynamical Systems and Reverse Engineering Problems

Simple item page
dc.creatorAvino-Diaz, Maria A.
dc.creatorGreen, Edward
dc.creatorMoreno, Oscar
dc.date2006-03-15
dc.date.accessioned2026-07-07T07:06:55Z
dc.date.available2026-07-07T07:06:55Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0603369
dc.identifierhttp://arxiv.org/abs/math/0603369
dc.identifier2004 ACM Symposium on Applied Computing, SAC04, Nicosia, Chipre
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/110204
dc.subjectDynamical Systems
dc.subjectRings and Algebras
dc.subjectQuantitative Methods
dc.subject11T99 ; 05C20
dc.titleApplications of Finite Fields to Dynamical Systems and Reverse Engineering Problems
dc.typetext

Files

Collections

arXiv