Z₂-algebras in the Boolean function irreducible decomposition

DOI10.1063/1.3685444zbMATH Open1274.94163arXiv1208.0332OpenAlexW1976173972MaRDI QIDQ2861702FDOQ2861702

Authors: Martha Takane, Federico Zertuche 

Publication date: 11 November 2013

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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 extit{NK}-Kauffman networks. We construct a ring-isomorphism $mathfrak{R}_K{i}_1,\mathrm{...},i_{l}ambdacongmathcal{P}^2-[K]$ of the set of reducible $K$-Boolean functions that are reducible in the Boolean arguments with indexes $i_1,\mathrm{...},i_{l}ambda$; 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 $varrh{o}_K(lambda,omega)$ of $K$-Boolean functions which are $lambda$-irreducible with weight $omega$. $varrh{o}_K(lambda,omega)$ is a fundamental quantity in the study of the stability of extit{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.

Full work available at URL: https://arxiv.org/abs/1208.0332

Recommendations

• On the robustness of \(NK\)-Kauffman networks against changes in their connections and Boolean functions
• Canalization and the stability of \(NK\)-Kauffman networks
• Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility
• On the number of \(NK\)-Kauffman networks mapped into a functional graph
• How many Boolean polynomials are irreducible?

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Probability Distributions Related to Random Mappings
• Exact solution of Kauffman's model with connectivity one
• On the robustness of \(NK\)-Kauffman networks against changes in their connections and Boolean functions
• Number of different binary functions generated by NK-Kauffman networks and the emergence of genetic robustness

Cited In (3)

• Canalization and the stability of \(NK\)-Kauffman networks
• Phase transition in \textit{NK}-Kauffman networks and its correction for Boolean irreducibility
• Title not available (Why is that?)

This page was built for publication: \(\mathbb{Z}_2\)-algebras in the Boolean function irreducible decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861702)