Given a nite set S , we dene a G-function on S to be a function that takes in an element of S and returns a (possibly empty) subset of S .

For instance, if g is dened by g (0) = {0, 2}, g (1) = {0}, g (2) = {1, 2}, then g is a G-function on the set {0, 1, 2}. For convenience, if U = {u1 , . . . , uk } is a subset of S , we will write g (U ) for the union of the sets g (u1 ), . . . , g (uk ). (If U is the empty set, then so is g (U ).)

1. a) How many G-functions are there on the set A = {0, 1, 2}? (1 point) b) How many G-functions are there on the set B = {0, 1, 2, 3} such that g (0) = {0, 2, 3}? Justify your answer. (2 points) c) How many G-functions are there on the set C = {0, 1, 2, 3} satisfying the condition that g (x) does not contain x for any x S ? (2 points) 2. We say that a G-function g on S is split if it is possible to split S into two parts, S = S1 S2 , such that g (S1 ) is contained in S2 and vice versa. a) How many split G-functions are there on the set T = {0, 1, 2}? (2 points) b) Given a G-function g on a set S , and starting with any element x S , we dene a sequence of sets as follows: Take X1 = g (x), X2 = g (X1 ), X3 = g (X2 ), etc. Prove that, if g is split, then there is some element of S not in X2010 . (3 points) c) If g is a split G-function on a set S , prove that there is a subset T S , at least half the size of S , such that, for any x, y T , x is not contained in g (y ). (3 points) A G-function on S is called balanced if, for each pair of elements x, y S , exactly one of the following is true: g (x) contains y , or g (y ) contains x. (In addition, we require that g (x) never contains x). An example of a balanced G-function on the set {0, 1, 2, 3} is: g (0) = {1, 2}, g (1) = {2}, g (2) = {3}, g (3) = {0, 1}.

3. a) How many balanced G-functions are there on the set A = {0, 1, 2, 3, 4}? (2 points) b) Conjecture and prove a general formula for the number of balanced Gfunctions on the set An = {0, 1, . . . , n 1}. (3 points) 4. A balanced G-function g on S is called fair if, for every x S , {x} g (x) g (g (x)) = S . (For instance, if S = {1, 2, 3}, then g (1) = 2, g (2) = 3, g (3) = 1 is fair and balanced.) Prove that there exists a fair G-function on {0, 1, . . . , 2010}. (5 points) 5. Suppose that g is a balanced G-function on a set S . Given a starting element y S , dene a sequence of sets as follows: Y0 = {y }, Y1 = Y0 g (Y0 ), Y2 = Y1 g (Y1 ), etc.

a) Conjecture necessary and sucient conditions on g such that, no matter what element y is our starting point, there is always some Yn which equals S . (3 points) b) Prove your conjecture. (5 points) A G-function on S is called parallel if, for each distinct pair of elements x, y S , g (x) contains y if and only if g (y ) contains x. (We also require that g (x) never contains x.) An example of a parallel G-function on the set {0, 1, 2, 3} is: g (0) = {1, 3}, g (1) = {0, 2}, g (2) = {1, 3}, and g (3) = {0, 2}.

6. a) How many parallel G-functions are there on the set A = {0, 1, 2, 3}? (2 points) b) Prove that the number of parallel G-functions on S is the same as the number of balanced G-functions on S . (3 points) c) Describe a one-to-one and onto map between the set of parallel G-functions on {0, . . . , 2010} and the set of bijective G-functions on the same set. (1 point) 7. If g is a parallel G-function on S , prove that there must exist two elements x, y S such that |g (x)| = |g (y )|. (5 points). 8. We say that a G-function g on S is k-split if it is possible to split S into k parts, S = S1 . . . Sk , such that g (Si ) Si is the empty set for every 1 i k . Let g be a balanced G-function, and let m be the maximum possible value of |g (x)|. Prove that g is (m + 1)-split. (8 points)