4 papers · 1 filter
Resolvable Triple Arrays
Alexey Gordeev, Lars-Daniel Öhman
We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-ex…
Near Triple Arrays
Alexey Gordeev, Klas Markström, Lars-Daniel Öhman
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows…
Enumeration of Row-Column Designs
Gerold Jäger, Klas Markström, Lars-Daniel Öhman +1
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 ne…
Triples of Orthogonal Latin and Youden Rectangles For Small Orders
Gerold Jäger, Klas Markström, Lars-Daniel Öhman +1
We have performed a complete enumeration of non-isotopic triples of mutually orthogonal Latin rectangles for . Here we will present a census of such tri…