Papers
Topics
Authors
Recent
Search
2000 character limit reached

Z_2-Algebras in the Boolean Function Irreducible Decomposition

Published 1 Aug 2012 in math-ph and math.MP | (1208.0332v1)

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 $ mathfrak{R}K {i_1, ..., i\lambda} \cong \mathcal{P}2 -[K] $ of the set of reducible $K$-Boolean functions that are reducible in the Boolean arguments with indexes ${i_1, ..., i_\lambda}$; and the double power set $\mathcal{P}2 [K]$, of the first $K$ natural numbers. This allows us, among other things, to calculate the number $\varrho_K (\lambda, \omega)$ of $K$-Boolean functions which are $\lambda $-irreducible with weight $\omega$. $\varrho_K (\lambda, \omega)$ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.