scientific article; zbMATH DE number 1011080
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.
- Super-simple balanced incomplete block designs with block size 4 and index 5
- Super-simple group divisible designs with block size 4 and index 5
- Block intersection numbers of block designs. II
- \(t\)-designs with few intersection numbers
- \((2s-1)\)-designs with \(s\) intersection numbers
- Super-simple balanced incomplete block designs with block size 4 and index 6
- Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4
- Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs)
- Super-simple twofold Steiner pentagon systems
- Optimization algorithms and cyclic designs
- Super-simple BIBDs with block size 4 and index 7
- Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\)
- Super-simple \((5, 4)\)-GDDs of group type \(g^u\)
- On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\)
- Super-simple balanced incomplete block designs with block size 4 and index 9
- Super-simple cyclic designs with small values
- Super-simple pairwise balanced designs with block sizes 3 and 4
- On the structure of 1-designs with at most two block intersection numbers
- Completely reducible super-simple designs with block size four and related super-simple packings
- Super-simple balanced incomplete block designs with block size 5 and index 3
- \(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs
- New constructions of Lotto designs
- Designs with maximally different blocks and v=15,16
- scientific article; zbMATH DE number 4172985 (Why is no real title available?)
- Super-simple resolvable balanced incomplete block designs with block size 4 and index 4
- Decomposable super-simple NRBIBDs with block size 4 and index 6
- Super-simple group divisible designs with block size 4 and index 9
- Super-simple designs with \(v\leq 32\)
- The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$
- Decomposable super‐simple BIBDs with block size 4 and index 4, 6
- The existence of 2³-decomposable super-simple (v,4,6)-BIBDs
- Completely reducible super-simple (v,4,4)-BIBDs and related constant weight codes
- The existence of 3²-DSS (4,6)-GDDs of type g^u
- Super-simple balanced incomplete block designs with block size 5 and index 8
- Super-simple \((v,5,4)\) designs
- Super-simple, pan-orientable and pan-decomposable GDDs with block size 4
- Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures
- Super-simple group divisible designs with block size 4 and index 2
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337362)
