An affine α-resolvable PBD of index λ is a triple (V, B, R), where V is a set (of points), B is a collection of subsets of V (blocks), and R is a partition of B (resolution), satisfying the following conditions: (i) any two points occur together in λ blocks, (ii) any point occurs in α blocks of each resolution class, and (iii) |B| = |V| + |R| − 1. Those designs embeddable in symmetric designs are described and two infinite series of embeddable designs are constructed. The analog of the Bruck–Ryser–Chowla theorem for affine α-resolvable PBDs is obtained.

Original languageEnglish
Pages (from-to)111-129
Number of pages19
JournalJournal of Combinatorial Designs
Volume6
Issue number2
DOIs
StatePublished - 1 Jan 1998

    Scopus subject areas

  • Discrete Mathematics and Combinatorics

    Research areas

  • Affine resolvable symmetric design, Pairwise balanced design, Resolvable

ID: 37147576