Joint realizability of monotone Boolean functions

نویسندگان

چکیده

The study of monotone Boolean functions (MBFs) has a long history. We explore connection between MBFs and ordinary differential equation (ODE) models gene regulation, and, in particular, problem the realization an MBF as function describing state transition graph ODE. formulate joint realizability finite collections by establishing parameterized dynamics class ODEs collection MBFs. pose question what can be realized that belong to nested classes defined increased algebraic complexity their right-hand sides. As we progressively restrict form ODE, show combination theory explicit examples jointly realizable strictly decreases. Our results impact regulatory network dynamics, well classical area conclude with series potential extensions conjectures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Influences of monotone Boolean functions

Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is to prove this conjecture.

متن کامل

Ceilings of Monotone Boolean Functions

This paper considers a particular relationship defined over pairs of n-argument monotone Boolean functions. The relationship is of interest since we can show that if ( g, h ) satisfy it then for any n-argument monotone Boolean function f there is a close relationship between the combinational and monotone network complexities of the function (f /\ g) \/ h. We characterise the class of pairs of ...

متن کامل

Locally monotone Boolean and pseudo-Boolean functions

We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...

متن کامل

Algorithms counting monotone Boolean functions

We give a new algorithm counting monotone Boolean functions of n variables (or equivalently the elements of free distributive lattices of n generators). We computed the number of monotone functions of 8 variables which is 56 130 437 228 687 557 907 788.  2001 Elsevier Science B.V. All rights reserved.

متن کامل

2 Learning Monotone Boolean Functions

Last time we finished the discussion about KM algorithm and its application. We also covered sparse Fourier representations and k-juntas of parities. In the end we started to talk about learning monotone Boolean functions and influence of such functions. Today We will first finish discussion about learning monotone Boolean functions. Then we will also talk about learning k-juntas of halfspaces....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2022

ISSN: ['1879-2294', '0304-3975']

DOI: https://doi.org/10.1016/j.tcs.2022.04.045