Strongly resolvable (r, λ)-designs

✍ Scribed by Albrecht Beutelspacher; Ulf Lamberty

• Publisher: Elsevier Science
• Year: 1983
• Tongue: English
• Weight: 1007 KB
• Volume: 45
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(83)90031-6

✦ Synopsis

The aim of this paper is to show the following Theorem: If D is an (r, A)-design (regular pairwise balanced design) with a resolution having c classes, then b + 12 u + c. EZquality holds if and only if the number of points on two distinct blocks depends only on the classes, the two blocks belong to. Resolvable (r, A)-designs with b + 1= u + c are called strongly resolvable.

Using symmetric block designs we shall construct many strongly resolvable (r, h&designs.