Vol. 12, No. 6, 2019

Download this article
Download this article For screen
For printing
Recent Issues

Volume 12
Issue 8, 1261–1439
Issue 7, 1081–1260
Issue 6, 901–1080
Issue 5, 721–899
Issue 4, 541–720
Issue 3, 361–539
Issue 2, 181–360
Issue 1, 1–180

Volume 11, 5 issues

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
About the Journal
Editorial Board
Subscriptions
Editors’ Interests
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Editorial Login
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
Author Index
Coming Soon
 
Other MSP Journals
The number of fixed points of AND-OR networks with chain topology

Alan Veliz-Cuba and Lauren Geiser

Vol. 12 (2019), No. 6, 1051–1068
Abstract

AND-OR networks are Boolean networks where each coordinate function is either the AND or OR logical operator. We study the number of fixed points of these Boolean networks in the case that they have a wiring diagram with chain topology. We find closed formulas for subclasses of these networks and recursive formulas in the general case. Our results allow for an effective computation of the number of fixed points in the case that the topology of the Boolean network is an open chain (finite or infinite) or a closed chain. We further explore how our approach could be used in “fractal” chains.

Keywords
Boolean networks, steady states, fixed points, discrete-time systems, AND-OR networks
Mathematical Subject Classification 2010
Primary: 94C10, 06E30, 05C99
Milestones
Received: 3 January 2019
Accepted: 21 April 2019
Published: 3 August 2019

Communicated by Kenneth S. Berenhaut
Authors
Alan Veliz-Cuba
Department of Mathematics
University of Dayton
Dayton, OH
United States
Lauren Geiser
University of Dayton
Dayton, OH
United States