Joint realizability of monotone Boolean functions

dc.contributor.authorCrawford-Kahrl, Peter
dc.contributor.authorCummins, Bree
dc.contributor.authorGedeon, Tomáš
dc.date.accessioned2022-10-20T16:23:20Z
dc.date.available2022-10-20T16:23:20Z
dc.date.issued2022-06
dc.description© This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/en_US
dc.description.abstractThe study of monotone Boolean functions (MBFs) has a long history. We explore a connection between MBFs and ordinary differential equation (ODE) models of gene regulation, and, in particular, a problem of the realization of an MBF as a function describing the state transition graph of an ODE. We formulate a problem of joint realizability of finite collections of MBFs by establishing a connection between the parameterized dynamics of a class of ODEs and a collection of MBFs. We pose a question of what collections of MBFs can be realized by ODEs that belong to nested classes defined by increased algebraic complexity of their right-hand sides. As we progressively restrict the algebraic form of the ODE, we show by a combination of theory and explicit examples that the class of jointly realizable functions strictly decreases. Our results impact the study of regulatory network dynamics, as well as the classical area of MBFs. We conclude with a series of potential extensions and conjectures.en_US
dc.identifier.citationCrawford-Kahrl, P., Cummins, B., & Gedeon, T. (2022). Joint realizability of monotone Boolean functions. Theoretical Computer Science.en_US
dc.identifier.issn0304-3975
dc.identifier.urihttps://scholarworks.montana.edu/handle/1/17293
dc.language.isoen_USen_US
dc.publisherElsevier BVen_US
dc.rightscc-by-nc-nden_US
dc.rights.urihttps://web.archive.org/web/20200106202134/https://www.elsevier.com/__data/promis_misc/external-embargo-list.pdf, https://perma.cc/J5MA-H2EJen_US
dc.subjectmonotone boolean funtionsen_US
dc.subjectgene regulatory networksen_US
dc.subjectswitching systemen_US
dc.titleJoint realizability of monotone Boolean functionsen_US
dc.typeArticleen_US
mus.citation.extentfirstpage1en_US
mus.citation.extentlastpage28en_US
mus.citation.journaltitleTheoretical Computer Scienceen_US
mus.citation.volume922en_US
mus.identifier.doi10.1016/j.tcs.2022.04.045en_US
mus.relation.collegeCollege of Letters & Scienceen_US
mus.relation.departmentMathematical Sciences.en_US
mus.relation.universityMontana State University - Bozemanen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
crawford-kahrl-boolean-2022.pdf
Size:
621.51 KB
Format:
Adobe Portable Document Format
Description:
joint realizability boolean functions

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
826 B
Format:
Item-specific license agreed upon to submission
Description:
Copyright (c) 2002-2022, LYRASIS. All rights reserved.