The minimum possible volume size of it μ-way (v, k, t) trades

被引:0
|
作者
Golalizadeh, Somayyeh [1 ]
Soltankhah, Nasrin [1 ]
机构
[1] Alzahra Univ, Fac Math Sci, POB 19834, Tehran, Iran
关键词
packing; trade; volume; foundation; GROUP-DIVISIBLE DESIGNS; LARGE SETS; BLOCK SIZE-3; DISJOINT PACKINGS; SPECTRUM;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A mu-way (v, k, t) trade is a pair T = (X, {T-1, T2 ...,T-mu}) such that for each t -subset of v -set X the number of blocks containing this t -subset is the same in each T, (1 < i < it). In the other words for each 1 < i < j <,, (X, {T,,T,}) is a (v, k, t) trade. There are many questions concerning p. -way trades. The main question is about the minimum volume and minimum foundation size of pt -way (v, k, t) trades. In this paper, we determine the minimum volume and minimum foundation size of p. -way (v,t 1, t) trades for each integer number mu > 3 and t = 2.
引用
收藏
页码:211 / 224
页数:14
相关论文
共 50 条