Monomial Dynamical Systems in # P-complete

In this paper, we study boolean monomial dynamical systems. Colon-Reyes, Jarrah, Laubenbacher, and Sturmfels(2006) studied fixed point structure of boolean monomial dynamical systems of f by associating the dynamical systems of f with its dependency graph χ f and Jarrah, Laubenbacher, and Veliz-Cuba(2010) extended it and presented lower and upper bound for the number of cycles of a given length for general boolean monomial dynamics. But, it is even difficult to determine the exact number of fixed points of boolean monomial dynamics. We show that the problem of counting fixed points of a boolean monomial dynamical systems is #P-complete, for which no efficient algorithm is known. This is proved by a 1-1 correspondence between fixed points of f sand antichains of the poset of strongly connected components of χf..

[1]  John E. Savage,et al.  The Complexity of Computing , 1976 .

[2]  Y. Zou,et al.  Linear dynamical systems over finite rings , 2008, 0810.3164.

[3]  R. Devaney.  An Introduction to Chaotic Dynamical Systems , 1990 .

[4]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[5]  Thomas D. Rogers,et al.  The graph of the square mapping on the prime fields , 1996, Discret. Math..

[6]  Algebraic Dynamics of Polynomial Maps on the Algebraic Closure of a Finite Field, II , 1994 .

[7]  B. Elspas,et al.  The Theory of Autonomous Linear Sequential Networks , 1959 .

[8]  Abdul Salam Jarrah,et al.  The Dynamics of Conjunctive and Disjunctive Boolean Networks , 2008, 0805.0275.

[9]  Frank Ruskey,et al.  Efficient Coroutine Generation of Constrained Gray Sequences , 2004, Essays in Memory of Ole-Johan Dahl.

[10]  Bernd Sturmfels,et al.  Monomial Dynamical Systems over Finite Fields , 2006, Complex Syst..

[11]  Abdul Salam Jarrah,et al.  The Dynamics of Conjunctive and Disjunctive Boolean Network Models , 2010, Bulletin of mathematical biology.

[12]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[13]  Clifford A. Reiter,et al.  Function digraphs of quadratic maps modulo p , 2001 .

[14]  C. Robinson.  Dynamical Systems: Stability, Symbolic Dynamics, and Chaos , 1994 .

[15]  Jeffrey Shallit,et al.  On the iteration of certain quadratic maps over GF(p) , 2004, Discret. Math..

[16]  René A. Hernández Toledo.  Linear Finite Dynamical Systems , 2005 .

[17]  W. Just.  The steady state system problem is NP-hard even for monotone quadratic Boolean dynamical systems , 2006 .