A simple \((2,3,v)\) trade is a pair \((T_0,T_1)\) of disjoint sets of \(3\)-subsets (blocks) of a \(v\)-set such that any two elements meet the same number of times in the blocks of \(T_0\) and the blocks of \(T_1\). The size of \(T_0\) equals the size of \(T_1\) and is called the volume of the trade. In this paper, for \(v=4n+2\), we introduce a new partitioning of the set of all 3-subsets of a v-set into the trades of volume \(4\), \(6\), and \(8\).

中文翻译：

---

完整设计的新分区

一个简单的\((2,3,v)\)交易是一对\((T_0,T_1)\)不相交的\(3\) -子集（块）的\(v\) -set 这样的任何两个元素在\(T_0\)的块和\(T_1\)的块中相遇的次数相同。的大小\（T_0 \）等于大小\（T_1 \）和被称为贸易量。在本文中，对于\(v=4n+2\)，我们将v集的所有 3 个子集的集合引入到交易量\(4\)，\(6\) 的交易中，和\(8\)。