Talk:Binate function

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

I think we have the wrong definition of binate. Doing a quick search on google I find the following [1]

A function is binate if it is not unate. A function f(x1; x2;...;xn)
is unate if for every xi; i = 1;...; n; f is either positive or negative unate in the variable xi. f is said to be positive unate in a variable xi, if for all 2^n-1 possible combinations of the remaining n-1 variables, f(x1; x2;...; xi􀀀1;1;xi+1;...;xn) >= f(x1; x2;...;xi􀀀1;0;xi+1;...; xn): In other words, changing variable xi from 0 to 1, f does not decrease. Similarly, f is said to be negative unate in a variable xi, if for all 2n􀀀1 possible combinations of the remaining n 􀀀 1 variables, f(x1; x2;...; xi􀀀1;0; xi+1;...; xn) >=
f(x1;x2;...;xi􀀀1;1; xi+1;...;xn):

this definition is very different simply a function with two arguments for which binary function is the more frequent term. --Salix alba (talk) 06:38, 29 April 2007 (UTC)[reply]