Fixed points of Boolean networks, guessing graphs, and coding theory

Maximilien Gadouleau, Adrien Richard, Søren Riis

In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques…