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

Abstract

A μ -way (v,k,t) trade is a pair T = {X,{T1T2r • • >T^}) such that for each t-subset of v-set X the number of blocks containing this (-subset is the same in each Ti< (1 ≤ i ≤ μ ,). In the other words for each 1 ≤ i ≤ μ (X,{TiTi}) is a (v,k,t) trade. There are many questions concerning μ -way trades. The main question is about the minimum volume and minimum foundation size of/i-way (v,k,t) trades. In this paper, we determine the minimum volume and minimum foundation size of μ -way( v,t + 1 ,t) trades for each integer number μ > 3 and t = 2. © 2019 Utilitas Mathematica Publishing Inc.. All rights reserved.