Enumeration and Construction of Row‐Column Designs

ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate. For larger parameter values, where complete enumeration is not feasible, we generate examples of some of the designs, and for some admissible parameter sets, we prove non‐existence results. We give some explicit constructions of sesqui arrays, mono arrays and AO‐arrays, in particular, we prove constructively that AO‐arrays exist for all feasible parameter sets. Finally, we investigate connections to Youden rectangles and binary pseudo‐Youden designs.