@article{Jang-Woo Park_Shuhong Gao_2012, title={Monomial Dynamical Systems in # P-complete}, volume={1}, url={https://mjis.chitkara.edu.in/index.php/mjis/article/view/163}, abstractNote={<p>In this paper, we study boolean monomial dynamical systems. Colón-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 χ<sub>f</sub> 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..</p>}, number={1}, journal={Mathematical Journal of Interdisciplinary Sciences}, author={Jang-Woo Park and Shuhong Gao}, year={2012}, month={Jul.}, pages={87-94} }