Algebraic Characterization of C-Regular Fractions Under Level Permutations

In this paper we study the behavior of the fractions of a factorial design under permutations of the factor levels. We code the s levels of a factor with the s-th roots of the unity. We focus on the notion of regular fraction in the complex coding, called C-regularity. We introduce methods to check whether a given symmetric orthogonal array can or cannot be transformed into a regular fraction by means of suitable permutations of the factor levels. The proposed techniques take advantage of the complex coding of the factor levels and of some tools from polynomial algebra. Several examples are described, mainly involving factors with five levels.