Mixtures of order matrices and generalized order matrices
โ Scribed by Nimrod Megiddo
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 549 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract We investigate signings of symmetric GDD($16 \times 2^i$, 16, $2^{4-i}$)s over $Z\_2$ for $1 \le i \le 3$. Beginning with $i=1$, at each stage of this process a signing of a GDD($16 \times 2^i$, 16, $2^{4-i}$) produces a GDD($16 \times 2^{i+1}$, 16, $2^{4-i-1}$). The initial GDDs ($i=1$
## Abstract Recently, A. B. Evans proved the following Theorem: There is a maximal set of (p โ 3)/2 [(resp. (p โ 1)/2] mutually orthogonal Latin squares of order __p__ if __p__ is a prime __p__ โก 3 mod 4 (resp. __p__ โก 1 mod 4). In this article I will give a slightly different proof using more geom
In this paper all the so-called checkered Hadamard matrices of order 16 are determined (i.e., Hadamard matrices consisting of 16 square blocks H i j of order 4 such that H ii = J 4 and H i j J 4 = J 4 H i j = 0 for i = j and where J 4 is the all-one matrix of order 4). It is shown that the checkered
A (maximal) difference matrix with r rows over a group G of order s gives rise to a (maximal) set of r -1 mutually orthogonal Latin squares of order s. The row sizes of maximal difference matrices are determined for all groups G of order ~<10.