An isomorphism check for two-level fractional factorial designs

Two fractional factorial designs are isomorphic if one can be obtained from the other by reordering the treatment combinations, relabelling the factor levels and relabelling the factors. By defining a word-pattern matrix, we are able to create a new isomorphism check which is much faster than existing checks for certain situations. We combine this with a new, extremely fast, sufficient condition for non-isomorphism to avoid checking certain cases. We then create a faster search algorithm by combining the Bingham and Sitter 1999. Minimum aberration fractional factorial split-plot designs. Technometrics 41, 62–70] search algorithm, the isomorphism check algorithm of Clark and Dean 2001. Equivalence of fractional factorial designs. Statist. Sinica 11, 537–547] with our proposed isomorphism check. The algorithm is used to extend the known set of existing non-isomorphic 128-run two-level regular designs with resolution ?4$?4$ to situations with 12, 13, 14, 15 and 16 factors, 256- and 512-run designs with resolution ?5$?5$ and ?17$?17$ factors and 1024-run even designs with resolution ?6$?6$ and ?18$?18$ factors.