论文信息 - Partitionable sets and cyclic BSECs with block size four

Partitionable sets and cyclic BSECs with block size four

Abstract In this article, we introduce a combinatorial structure called a partitionable set. We use these sets to construct cyclic balanced sampling plans excluding contiguous units. Two recursive constructions for CBSEC ( v , 4 , 1 ) 's are established by utilizing partitionable sets and difference matrices. As consequent we get the existence of a CBSEC ( au , 4 , 1 ) where u is a product of numbers in Q = { p : p ≡ 1 ( mod 4 ) and p is prime } ∪ { q : q ≡ 1 , 5 ( mod 12 ) , q ⩽ 160 } and a ∈ { 3 , 27 , 63 , 99 , 171 , 207 , 243 } .

Yanxun Chang | Jing Zhang

[1] John Stufken,et al. On a class of partially balanced incomplete block designs with applications in survey sampling , 1997 .

[2] Charles J. Colbourn. Group testing for consecutive positives , 1999 .

[3] D. Horvitz,et al. A Generalization of Sampling Without Replacement from a Finite Universe , 1952 .

[4] Ruizhong Wei. Cyclic BSEC of block size 3 , 2002, Discret. Math..

[5] A. S. Hedayat,et al. 24 Designs in survey sampling avoiding contiguous units , 1988 .

[6] C. Colbourn,et al. Recursive constructions for cyclic block designs , 1984 .

[7] Charles J. Colbourn,et al. Balanced sampling plans with block size four excluding contiguous units , 1999, Australas. J Comb..

[8] Jing Zhang,et al. The spectrum of cyclic BSEC with block size three , 2005, Discret. Math..

[9] A. S. Hedayat,et al. Sampling plans excluding contiguous units , 1988 .

[10] Charles J. Colbourn,et al. A class of partial triple systems with applications in survey sampling , 1998 .