Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T02:34:17.636Z Has data issue: false hasContentIssue false

Limits on Pairwise Amicable Orthogonal Designs

Published online by Cambridge University Press:  20 November 2018

Warren Wolfe*
Affiliation:
Royal Roads, Mutiary College, Victoria, British Columbia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

An orthogonal design in order n of type (u 1, …, ut ) on the commuting variables x 1, …, xt is an n × n matrix X with entries 0, ±x 1, …, ±xt such that

In [5] Geramita and Wallis show that if n = 24a+b ·n 0, where n 0 is odd and 0 ≦ b > 4, then t ≧ ρ(n) = 8a + 2b. The result is essentially Radon's limit on the number of anti-commuting, real, anti-symmetric, orthogonal matrices in order n. Garamita and Pullman show that this limit is sharp for orthogonal designs: i.e., given n, there exists an orthogonal design in order n with ρ(n) variables [6].

Two orthogonal designs, X and F, are called amicable if XYt = YXt.

Such pairs of orthogonal designs are especially useful in generating new orthogonal designs [5] or [6].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1981