Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science
Decomposition of complete designs
Abstract
dc:description.abstractThrough six chapters, the concept of decomposing the complete design is demonstrated. Group divisible designs, symmetric designs, strongly regular graphs, and association schemes are examples of the combinatorial objects that complete designs are decomposed into. Reconstructing McFarland designs leads to the existence of sets of designs with disjoint incidence matrices whose sum is the complete design. The existence of infinite classes of symmetric association schemes follows from the decomposition. Applying a similar technique on the Spence designs provides sets of designs all sharing the same complete tripartite graphs. By appropriately splitting the designs a decomposition of the complete design is obtained leading to an infinite class of non-commutative association schemes. A final attempt is made to combine the constructed decomposition with specific classes of balanced generalized weighing matrices.
Degree
thesis:*- Level thesis:degree_level
- Ph.D
- Grantor dc:publisher
- Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science
- Year dc:date.issued
- 2019
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Sasani, Sara
- University of Lethbridge. Faculty of Arts and Science
- Advisor dc:contributor.supervisor
-
- Kharaghani, Hadi
Subjects
dc:subject × 5Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10133/5654