Hi all, I am looking for some help with the following question. Take a discrete bivariate function (i.e., , take values in some finite sets). Is there a way to quantify how "embeddable" this function is in Abelian groups. For example, if are binary and f(x,y) = x XOR y, then f is clearly embeddable in (the cyclic group on 2 elements). But if f(x,y) = x AND y, f's action can only be mimicked in . (i.e., treat and as elements of , add them in and map the outputs as {0,1}->0, 2->1 to mimic the AND function). Is there a formal way to characterize the smallest Abelian group in which a given f(x,y) can be embedded? I would greatly appreciate any help/reference/pointers.
Thanks,
Dinesh.
More precisely, let be a finite set and let be a function. How do we determine the smallest abelian group for which there exist functions and such that ?
No comments:
Post a Comment