Finite Geometry has been one of the interesting areas of research in the field of Combinatorics and has seen tremendous advancement in the 20th century after the introduction of Finite Nets by R. H. Bruck in 1951. In the early chapters of the thesis, we survey the concept of “Nets (finite) and Translation Nets” in two dimension and in three dimension. We also try to fill in the gaps found and formulate equivalent mathematical definitions. Some of the drawbacks in Laskar’s definition for nets of dimension three led to the redefinition by fixing the parameters involved. Then, the concept of “partial congruence partition” in three dimension, denoted by PCP(3), is introduced and the equivalence of PCP(3) and translation nets of dimension three is also proved. The latter chapters cover the concept of Association Scheme and extend the definition of a net and partial congruence partition to n-dimension. Several new parameters for “Association Scheme of class 3” are also derived. (Abstract shortened by UMI.)
|School:||National University of Singapore (Singapore)|
|School Location:||Republic of Singapore|
|Source:||DAI-B 77/06(E), Dissertation Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be