A doubly divisible nearly Kirkman system
暂无分享,去创建一个
Abstract In this note we exhibit an example of a new class of combinatorial array. A Room square [9] is an r × r square each of whose cells is either empty or contains a distinct unordered pair with entries from the set of integers {1, 2,…, r + 1} such that each integer appears exactly once in each row and exactly once in each column. We present an analogous square whose entries are unordered triples, none of whose two-element subsets is repeated.
[1] A. Street,et al. Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .
[2] Richard M. Wilson,et al. On resolvable designs , 1972, Discret. Math..
[3] R. Mullin,et al. Construction of Room Squares , 1968 .
[4] D. Raghavarao. Constructions and Combinatorial Problems in Design of Experiments , 1971 .
[5] Prince Camille de Polignac. On a Problem in Combinations , 1866 .