Z_2-Algebras in the Boolean Function Irreducible Decomposition
arXiv:1208.0332 · doi:10.1063/1.3685444
Abstract
We develop further the consequences of the irreducible-Boolean classification established in Ref. [9]; which have the advantage of allowing strong statistical calculations in disordered Boolean function models, such as the \textit{NK}-Kauffman networks. We construct a ring-isomorphism of the set of reducible -Boolean functions that are reducible in the Boolean arguments with indexes ; and the double power set , of the first natural numbers. This allows us, among other things, to calculate the number of -Boolean functions which are -irreducible with weight . is a fundamental quantity in the study of the stability of \textit{NK}-Kauffman networks against changes in their connections between their Boolean functions; as well as in the mean field study of their dynamics when Boolean irreducibility is taken into account.
Published