Balanced block designs and various properties

Khodkar, Abdollah (1994). Balanced block designs and various properties PhD Thesis, School of Physical Sciences. doi:10.14264/uql.2015.470

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
THE8559.pdf Thesis (fulltext) application/pdf 3.40MB 0
Author Khodkar, Abdollah
Thesis Title Balanced block designs and various properties
School, Centre or Institute School of Physical Sciences
DOI 10.14264/uql.2015.470
Publication date 1994-01-01
Thesis type PhD Thesis
Supervisor Elizabeth J. Billington
Total pages 223
Language eng
Subjects 010102 Algebraic and Differential Geometry
Formatted abstract
A block design is an ordered pair (V,B), where V is a finite set and B is a collection of subsets or multi-subsets of V (called blocks). Usually extra conditions are imposed on this collection B. In this work we study the existence of certain designs, the intersection problem for some designs, the structure of repeated blocks in designs and the existence of designs in which any two blocks have at most two elements in common (super-simple designs). We also investigate subsets of the element set of a design which intersect all the blocks of the design (covering sets). Finally, we study multi-subsets of the block set of a design which can uniquely be completed to the design. 

We start in Chapter 1 with some necessary definitions. Then in Chapter 2 we deal with the construction of some designs called balanced ternary designs or BTDs. In Section 2.1 we first construct a family of cyclic BTDs of odd order 2n — 1 with an automorphism of order 2n — 1. Then in a similar way, we construct a BTD of order n with block size 2m for 4≤  2m ≤ n. In Section 2.2 we give necessary and sufficient conditions for the existence of a BTD with block size 4, any index λ, and p2 ≤ 6. These results extend the results in Donovan [27] and Donovan [28]. 

In Chapter 3 we concentrate on the intersection problem for BTDs with block size 3. In Section 3.1 we give some general constructions for a BTD with a hole. Then in Sections 3.2, 3.3 and 3.4 we determine the number of common triples in two simple BTDs with block size 3 and index 2, for p2 = 0, 3 and 4. (Similar results for the cases p2 = 1, 2 can be found in Bilhngton and Hoffman [10] and Billington and Mahmoodian [12].) In Section 3.5 we construct pairs of simple BTDs with block size 3, index 3 and p2 = 3 having exactly m, blocks in common for all admissible m. In Section 3.6 we investigate the intersection problem for directed triple systems with index 2. (A similar result for index 1 has appeared in Lindner and Wallis [54] and Fu [30].)

We study BTDs with repeated blocks in Chapter 4. Indeed, we determine the fine  structure of a BTD with block size 3, index 3 and p2 = 3. This result is parallel to the result for balanced incomplete block designs or BIBDs with block size 3 and index 3 (see  Colbourn, Mathon, Rosa and Shalaby [23] and Colbourn, Mathon and Shalaby [24]). 

In Chapter 5 we study (v-p2;4, λ) BTDs, where (p2,λ)  ∈ {(0,2), (1,2), (2,2), (0,4)}, with the property that any 3-multi- ubset of the element set can occur at most once in the blocks of the design. (Cases with p2 = 0 here are of course BIBDs). Designs with  this property are called super-simple designs. In Sections 5.2 and 5.3 we deal with super-simple (v;,4, 2) BIBDs, correcting a result in Gronau and Mullin [37]. In Sections 5.4,  5.5 and 5.6 we prove that there exists a super-simple (v; p2;4, λ) BTD, where (p2,λ) ∈  {(1,2), (2,2), (0,4)}, for all admissible v. Finally, in Section 5.7, the non-existence of a certain super-simple group divisible design is proved.

In Chapter 6 we investigate smallest covering sets for t-designs with block size t + 1. In Section 6.1 we give some preliminary results, including an upper bound on the size of a smallest covering set for a symmetric (v, k, λ) BIBD. Then in Section 6.2, we find some results on smallest covering sets for t-(v, t + 1, λ) designs. Finally, in Section 6.3, we find  smallest covering sets for some well-known t-designs.

In Chapter 7 we find a smallest defining set for each of the 36 non-isomorphic two-fold triple systems of order nine.
Keyword Block designs

Document type: Thesis
Collection: UQ Theses (RHD) - UQ staff and students only
Citation counts: Google Scholar Search Google Scholar
Created: Sat, 31 Jan 2015, 00:52:35 EST by Mary-Anne Marrington on behalf of Scholarly Communication and Digitisation Service