WorksComputer Science
A Recursive Construction of Perfect Arrays of Every Shape over the Unit Quaternions
Abstract
We extend the recursive construction of perfect and odd perfect sequences over the simple unit quaternions \Qe=\{\pm1,\pm i,\pm j,\pm k\} of Blake to arrays of any dimension. The three operations of that construction act on one direction of an array at a time, and are valid whenever the array is periodic in the remaining directions. Starting from a perfect array of shape they give perfect arrays of shape for every , with explicit index functions and with the array orthogonality property for the divisor in the lifted direction; from on these arrays are, in general, Kronecker products of a sequence with in neither order. Applied direction by direction, the construction gives perfect arrays over \Qe in every shape , and in every shape for which a perfect sequence of length over \Qe exists. The contrast with the binary alphabet is sharp: a perfect binary array of shape exists only when is even and , by a theorem of Jedwab and Kraemer on Menon difference sets in abelian -groups, whereas over \Qe there is no constraint on the shape. We also show that, unlike the one-dimensional case, single arrays carrying a non-central twist do exist in two dimensions, and determine where the one-dimensional non-existence argument breaks.