A hierarchy of complete orthogonal structures
CF Laywine, GL Mullen - Ars Combinatoria, 2002 - pure.psu.edu
CF Laywine, GL Mullen
Ars Combinatoria, 2002•pure.psu.eduWe provide a hierarchy, linearly ordered by inclusion, describing various complete sets of
combinatorial objects starting with complete sets of mutually orthogonal latin squares,
generalizing to affine geometries and designs, frequency squares and hypercubes, and
ending with (t, m, s)-nets.
combinatorial objects starting with complete sets of mutually orthogonal latin squares,
generalizing to affine geometries and designs, frequency squares and hypercubes, and
ending with (t, m, s)-nets.
Abstract
We provide a hierarchy, linearly ordered by inclusion, describing various complete sets of combinatorial objects starting with complete sets of mutually orthogonal latin squares, generalizing to affine geometries and designs, frequency squares and hypercubes, and ending with (t, m, s)-nets.
pure.psu.edu
Showing the best result for this search. See all results