EUVIMEDEUVIMED entdecken
Crossref

Trapping and commutative Boolean networks

Maximilien Gadouleau

Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 373-408

DOI: 10.61091/jcmcc131-18 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Maximilien Gadouleau.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A Boolean network maps Boolean configurations of fixed length to themselves. A trapspace is an invariant subcube; a principal trapspace is the smallest trapspace containing a configuration, while a minimal trapspace contains no proper trapspace. Commutative Boolean networks are those whose local updates commute. We connect these concepts through five contributions. First, we introduce trapping graphs and trapping closures, define trapping networks by transitivity of their general asynchronous graphs, and prove that they are exactly the trapping closures. Second, we show that two Boolean networks have the same collections of principal trapspaces if and only if they have the same trapping closure. Hence, trapping networks provide a normal form for trapspace analysis. We also characterize the possible collections of principal and minimal trapspaces. Third, we prove that commutative networks are trapping and classify their principal trapspaces. Fourth, we study bijective commutative networks, called Marseille networks, and give equivalent characterizations and classifications. Fifth, we study idempotent commutative networks, called Lille networks, relate them to globally idempotent networks, prove that globally idempotent networks are trapping, and provide equivalent characterizations. These results clarify the relationships among asynchronous, general asynchronous, and trapping graphs and describe the structure of trapping networks.

Zitieren

APA

Gadouleau, M. (2026). Trapping and commutative Boolean networks. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 373-408. https://doi.org/10.61091/jcmcc131-18

Vancouver

Gadouleau M. Trapping and commutative Boolean networks. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:373-408. doi:10.61091/jcmcc131-18

BibTeX
@article{Gadouleau2026,
  author = {Gadouleau, Maximilien},
  title = {Trapping and commutative Boolean networks},
  journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
  year = {2026},
  volume = {131},
  pages = {373--408},
  doi = {10.61091/jcmcc131-18}
}
Kostenlos starten →