Polynomials which take Gaussian integer values at Gaussian integers

A factorial set for the Gaussian integers is a set G = {g₁, g₂ … g_n} of Gaussian integers such that $\text{G(z) =}\text{Π}{}_{\mathrm{k}}\text{(z ? g}{}_{\mathrm{k}}\text{)}\text{g}{}_{\mathrm{k}}$ takes Gaussian integer values at Gaussian integers. We characterize factorial sets and give a lower bound for $\text{max}{}_{\mathrm{<mtext>\parallel z\parallel 2=</mtext><mtext>n</mtext><mtext>\pi </mtext>}}\text{∥ G(z)∥}$. It is conjectured that there are infinitely many factorial sets. A Gaussian integer valued polynomial (GIP) is a polynomial with the title property. A bound similar to the above is given for max_∥z∥2=n ∥ G(z)∥ if G(z) is a GIP. There is a relation between factorial sets and testing for GIP's. We discuss this and close with some examples of factorial sets, and speculate on how to find more.