Algebraic characterization of regular fractions under level permutations

2017/05/03 by Fabio Rapallo, Rapallo, Fabio, Maria Piera Rogantin +1
Computer Science · Decision Sciences · Engineering · #13P10 #62K15 #FOS: Computer and information sciences #FOS: Mathematics #Methodology (stat.ME) #Optimal Experimental Design Methods #Statistics Theory (math.ST) #VLSI and Analog Circuit Testing #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1705.01340

openalex publication_date 2017/05/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we study the behavior of the fractions of a factorial design under permutations of the factor levels. We focus on the notion of regular fraction and we introduce methods to check whether a given symmetric orthogonal array can or can not 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.

Related

• Generation of Fractional Factorial Designs
• Indicator function and complex coding for mixed fractional factorial designs
• A note on the minimum size of an orthogonal array
• Use of primary decomposition of polynomial ideals arising from indicator functions to enumerate orthogonal fractions
• 2-level fractional factorial designs which are the union of non trivial regular designs