Maximum number of fixed points in AND–OR–NOT networks

International audienceWe are interested in the number of fixed points in AND-OR-NOT networks, i.e. Boolean networks in which the update function of each component is either a conjunction or a disjunction of positive or negative literals. As main result, we prove that the maximum number of fixed points in a loop-less connected AND-OR-NOT network with n components is at most the maximum number of maximal independent sets in a loop-less connected graph with n vertices, a quantity already known