On the existence of one-sided designs |
| |
Authors: | J. K. Doyle C. J. Leska |
| |
Affiliation: | (1) Syracuse University, 13210 Syracuse, New York, USA;(2) Armstrong State College, 31406 Savannah, Georgia, USA |
| |
Abstract: | A collection of subsets (called blocks) of a fixed vertex set (possibly with repetition) is called a (tn, tn–1, ..., t1; am, am–1, ..., a1)-design if it satisfies certain regularity conditions on the number of blocks which contain subsets of the vertex set of certain size, and other regularity conditions on the size of the intersections of certain numbers of the blocks. (For example, a BIBD (or (b, v, r, k, )-configuration) is a (1, 2; 1)-design, and a t-design is a (t, t–1, ..., 1; 1)-design.) A design has design-type (tn, ..., t1; am, ..., a1) if it satisfies only those conditions. A one-sided design is a design with design-type (tn, ..., t1;) or (;am, ..., a1). In this paper we show, by construction, that any one-sided design-type is possible. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|