No label defined (Q4337362)

The problem of determination of maximal intersection numbers for \(t\)-\((v,k,\lambda)\) designs is researched. Let \(p=\max_{1\leq i<j\leq b}| B_i\cap B_j|\). Set \(p^*=\min p\), where the minimum is taken over all designs with parameters \(t\)-\((v,k,\lambda)\) and \(D=\{B_1,\ldots,B_b\}\). Designs for which \(p=p^*\) are called designs with maximally different blocks, or DMDBs, and \(p\) is called the maximal intersection number of \(D\). Theorem (Driessen). If \(D\) is a \(t\)-\((v,k,\lambda)\) design with a maximal intersection number \(p\leq k-m-l-1\), for fixed integers \(m,l\geq 0\), then \[ D_{ml}=\big\{(B\cup L)\backslash M : B\in D,\;M\subseteq B,\;| M|=m,\;L\subseteq(X\backslash B), | L|=l\big\} \] is a \[ t\text{-} \left( v,k+l-m,\;\lambda \binom{v-k} {l} \binom{k+l-m}{t} \binom{k}{m} \binom{k}{t}\right) \text{ design}. \] (Note that \(D_{00}=D\).) From the theorem of Driessen the author concludes some corollaries. In particular he shows that if \(D\) is a simple \(t\)-\((v,k,\lambda)\) design, then \(\{X\backslash B : B\in D\}\) is a simple \(t\)-\((v,v-k, \lambda \binom{v-k}{t}\binom{k}{t})\) design. The author gives a table of 151 new designs.