A table of primitive binary polynomials
Mathematics of Computation
On the threshold of chaos in random Boolean cellular automata
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
An O(n3) algorithm for the Frobenius normal form
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Subquadratic-time factoring of polynomials over finite fields
Mathematics of Computation
Algebraic Methods for Signal Processing and Communication Coding
Algebraic Methods for Signal Processing and Communication Coding
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Modern Computer Algebra
Toward a solution of the reverse engineering problem using FPGAs
Euro-Par'06 Proceedings of the CoreGRID 2006, UNICORE Summit 2006, Petascale Computational Biology and Bioinformatics conference on Parallel processing
Comparison of bit and word level algorithms for evaluating unstructured functions over finite rings
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
A Control Theory for Boolean Monomial Dynamical Systems
Discrete Event Dynamic Systems
Reconfigurable hardware implementation of a multivariate polynomial interpolation algorithm
International Journal of Reconfigurable Computing - Special issue on selected papers from ReconFig 2009 International conference on reconfigurable computing and FPGAs (ReconFig 2009)
| Hi-index | 0.00 |
It is desirable to have efficient mathematical methods to extract information about regulatory iterations between genes from repeated measurements of gene transcript concentrations. One piece of information is of interest when the dynamics reaches a steady state. In this paper we develop tools that enable the detection of steady states that are modeled by fixed points in discrete finite dynamical systems. We discuss two algebraic models, a univariate model and a multivariate model. We show that these two models are equivalent and that one can be converted to the other by means of a discrete Fourier transform. We give a new, more general definition of a linear finite dynamical system and we give a necessary and sufficient condition for such a system to be a fixed point system, that is, all cycles are of length one. We show how this result for generalized linear systems can be used to determine when certain nonlinear systems (monomial dynamical systems over finite fields) are fixed point systems. We also show how it is possible to determine in polynomial time when an ordinary linear system (defined over a finite field) is a fixed point system. We conclude with a necessary condition for a univariate finite dynamical system to be a fixed point system.