Locally monotone Boolean and pseudo-Boolean functions

Details Locally monotone Boolean and pseudo-Boolean functions Locally monotone Boolean and pseudo-Boolean functions

2011-07-06

arxiv.org/abs/1107.1161v1

Computer Science

Discrete Mathematics

Scientific paper

We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if each of its partial derivatives keeps the same sign on tuples which differ on less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are shown to be tightly related to lattice counterparts of classical partial derivatives via the notion of permutable derivatives. More precisely, p-locally monotone functions are shown to have p-permutable lattice derivatives and, in the case of symmetric functions, these two notions coincide. We provide further results relating these two notions, and present a classification of p-locally monotone functions, as well as of functions having p-permutable derivatives, in terms of certain forbidden "sections", i.e., functions which can be obtained by substituting variables for constants. This description is made explicit in the special case when p=2.

Affiliated with

Also associated with

No associations

Rating

Locally monotone Boolean and pseudo-Boolean functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Locally monotone Boolean and pseudo-Boolean functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locally monotone Boolean and pseudo-Boolean functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678651