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 条
  • [31] A deterministic algorithm for finding all minimum k-way cuts
    Kamidoi, Yoko
    Yoshida, Noriyoshi
    Nagamochi, Hiroshi
    [J]. SIAM JOURNAL ON COMPUTING, 2006, 36 (05) : 1329 - 1341
  • [32] A note on the minimum size of k-rainbow-connected graphs
    Lo, Allan
    [J]. DISCRETE MATHEMATICS, 2014, 331 : 20 - 21
  • [33] EVALUATION OF MOMENTS OF K V(T)/IV(T)
    LING, CB
    LIN, J
    [J]. MATHEMATICS OF COMPUTATION, 1972, 26 (118) : 529 - &
  • [34] PROSTAGLANDIN-E AS A POSSIBLE CONTROL MECHANISM FOR EXCRETION OF POTASSIUM (K), CREATININE (CR), SODIUM (NA) AND VOLUME (V)
    BOWDEN, RE
    KEISER, HR
    [J]. CLINICAL RESEARCH, 1976, 24 (03): : A395 - A395
  • [35] Faster algorithms for finding a minimum k-way cut in a weighted graph
    Kamidoi, Y
    Wakabayashi, S
    Yoshida, N
    [J]. ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 1009 - 1012
  • [36] Minimum K-Way Cuts via Deterministic Greedy Tree Packing
    Thorup, Mikkel
    [J]. STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 159 - 165
  • [37] A divide-and-conquer approach to the minimum k-way cut problem
    Kamidoi, Y
    Wakabayashi, S
    Yoshida, N
    [J]. ALGORITHMICA, 2002, 32 (02) : 262 - 276
  • [38] A LINEAR ALGEBRAIC ALGORITHM FOR REDUCING THE SUPPORT SIZE OF T-DESIGNS AND TO GENERATE A BASIS FOR TRADES
    KHOSROVSHAHI, GB
    MAHMOODIAN, ES
    [J]. COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 1987, 16 (04) : 1015 - 1038
  • [39] T dwarfs all the way to 550K?
    Burningham, Ben
    Pinfield, D. J.
    Leggett, S. K.
    Tamura, M.
    Lucas, P. W.
    Homeier, D.
    [J]. COOL STARS, STELLAR SYSTEMS AND THE SUN, 2009, 1094 : 184 - +
  • [40] The alxisymmetric nose shape of minimum wave drag forl given size and volume
    Yefremov, NL
    Kraiko, AN
    P'Yankov, KS
    [J]. PMM JOURNAL OF APPLIED MATHEMATICS AND MECHANICS, 2005, 69 (05): : 649 - 664