The number oft-wise balanced designs
暂无分享,去创建一个
AbstractWe prove that the number oft-wise balanced designs of ordern is asymptotically
$$n\left( {(_t^n )/(t + 1)} \right)(1 + o(1))$$
, provided that blocks of sizet are permitted. In the process, we prove that the number oft-profiles (multisets of block sizes) is bounded below by
$$\exp \left( {c_1 = \sqrt n \log n} \right)$$
and above by
$$\exp \left( {c_2 = \sqrt n \log n} \right)$$
for constants c2>c1>0.
[1] Kevin T. Phelps,et al. Block Sizes in Pairwise Balanced Designs , 1984, Canadian Mathematical Bulletin.
[2] Vojtech Rödl,et al. On a Packing and Covering Problem , 1985, Eur. J. Comb..
[3] Richard M. Wilson,et al. Nonisomorphic Steiner triple systems , 1974 .
[4] V. E. Alekseev. On the number of steiner triple systems , 1974 .