论文信息 - Orthogonal resolutions in odd balanced tournament designs

Orthogonal resolutions in odd balanced tournament designs

An odd balanced tournament design,OBTD(n), is ann × 2n + 1 array of pairs defined on a (2n + 1)-setV such that (1) every row of the array contains each element ofV twice, (2) every column of the array contains 2n distinct elements ofV, and (3) the pairs of the array form a (2n + 1, 2, 1)-BIBD. In this paper, we investigate the spectrum of odd balanced tournament designs with orthogonal resolutions. These designs can be used to construct doubly near resolvable (v, 3, 2)-BIBDs.

Scott A. Vanstone | Esther R. Lamken | S. Vanstone | E. Lamken

[1] J. D. Horton,et al. Puintuplication of Room squares , 1971 .

[2] S. A. VANSTONE,et al. Doubly resolvable designs , 1980, Discret. Math..

[3] Douglas R. Stinson,et al. The Spectrum of Room Cubes , 1981, Eur. J. Comb..

[4] R. Mullin,et al. An Existence Theorem for Room Squares* , 1969, Canadian Mathematical Bulletin.

[5] A multiplication theorem for strong starters , 1974 .

[6] J. D. Horton. Room designs and one-factorizations , 1981 .

[7] W. D. Wallis,et al. The existence of Room squares , 1975 .

[8] L. Zhu,et al. On sets of three mols with holes , 1985, Discret. Math..

[9] A. Street,et al. Combinatorics: room squares, sum-free sets, Hadamard matrices , 1972 .

[10] Ronald C. Mullin,et al. On the existence of frames , 1981, Discret. Math..