{
  "id": "1609.02526",
  "version": "v1",
  "published": "2016-09-08T18:40:33.000Z",
  "updated": "2016-09-08T18:40:33.000Z",
  "title": "The Number of Fixed Points of AND-OR Networks with Chain Topology",
  "authors": [
    "Alan Veliz-Cuba",
    "Lauren Geiser"
  ],
  "comment": "12 pages, 3 figures",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-09-08T18:40:33.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "fixed points",
      "and-or networks",
      "chain topology",
      "boolean network",
      "general case"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}