Back to results

University of Lethbridge

Amicable T-matrices and applications

Abstract

Our main aim in this thesis is to produce new T-matrices from the set of existing T-matrices. In Theorem 4.3 a multiplication method is introduced to generate new T-matrices of order st, provided that there are some specially structured T-matrices of orders s and t. A class of properly amicable and double disjoint T-matrices are introduced. A number of properly amicable T-matrices are constructed which includes 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 18, 22. To keep the new matrices disjoint an extra condition is imposed on one set of T-matrices and named double disjoint T-matrices. It is shown that there are some T-matrices that are both double disjoint and properly amicable. Using these matrices an infinite family of new T-matrices are constructed. We then turn our attention to the application of T-matrices to construct orthogonal designs and complex Hadamard matrices. Using T-matrices some orthogonal designs constructed from 16 circulant matrices are constructed. It is known that having T-matrices of order t and orthogonal designs constructible from 16 circulant matrices lead to an infinite family of orthogonal designs. Using amicable T-matrices some complex Hadamard matrices are shown to exist.

Author and committee

dc:creator, dc:contributor.*
Author
  • Gholamiangonabadi, Hamed

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Identifier
hdl:10133/3262
OAI identifier oai:identifier
oai:opus.uleth.ca:10133/3262

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-07-27
Source record
OAI-PMH GetRecord
citation

Gholamiangonabadi, Hamed. Amicable T-matrices and applications. 2012.