Open AccessA Construction Technique for Group Divisible (v-1,k,0,1) Partially Balanced Incomplete Block Designs (PBIBDs)
Author(s) -
Oluwaseun A. Otekunrin,
Kehinde O. Alawode
Publication year - 2021
Publication title -
asian journal of probability and statistics
Language(s) - English
Resource type - Journals
ISSN - 2582-0230
DOI - 10.9734/ajpas/2021/v14i130319
Subject(s) - group (periodic table) , block (permutation group theory) , matlab , combinatorics , order (exchange) , mathematics , construct (python library) , computer science , discrete mathematics , physics , programming language , finance , quantum mechanics , economics
Group Divisible PBIBDs are important combinatorial structures with diverse applications. In this paper, we provided a construction technique for Group Divisible (v-1,k,0,1) PBIBDs. This was achieved by using techniques described in literature to construct Nim addition tables of order 2n, 2≤n≤5 and (k2,b,r,k,1)Resolvable BIBDs respectively. A “block cutting” procedure was thereafter used to generate corresponding Group Divisible (v-1,k,0,1) PBIBDs from the (k2,b,r,k,1)Resolvable BIBDs. These procedures were streamlined and implemented in MATLAB. The generated designs are regular with parameters(15,15,4,4,5,3,0,1);(63,63,8,8,9,7,0,1);(255,255,16,16,17,15,0,1) and (1023,1023,32,32,33,31,0,1). The MATLAB codes written are useful for generating the blocks of the designs which can be easily adapted and utilized in other relevant studies. Also, we have been able to establish a link between the game of Nim and Group Divisible (v-1,k,0,1) PBIBDs.