Weighing matrix should not be confused with Weight matrix.
In mathematics, a weighing matrix of order
n
w
W
\{0,1,-1\}
WWT=wIn
Where
WT
W
In
n
w
n
w
W(n,w)
Weighing matrices are so called because of their use in optimally measuring the individual weights of multiple objects. When the weighing device is a balance scale, the statistical variance of the measurement can be minimized by weighing multiple objects at once, including some objects in the opposite pan of the scale where they subtract from the measurement.
Some properties are immediate from the definition. If
W
W(n,w)
W
W
w
WTW=wI
W-1
\detW=\pmwn/2
\detW
A weighing matrix is a generalization of Hadamard matrix, which does not allow zero entries. As two special cases, a
W(n,n)
W(n,n-1)
Weighing matrices take their name from the problem of measuring the weight of multiple objects. If a measuring device has a statistical variance of
\sigma2
N
2\sigma2
An order
n
W
n
n
wij
wij=\begin{cases} 0&ifontheithtrialthejthobjectwasnotmeasured\\ 1&ifontheithtrialthejthobjectwasplacedintheleftpan\\ -1&ifontheithtrialthejthobjectwasplacedintherightpan\\ \end{cases}
Let
x
n
e
\sigma2
y
n
x=Wy+e
Assuming that
W
y=(WTW)-1Wx
The variance of the estimated
y
\sigma2/n
W
Weighing matrices appear in the engineering of spectrometers, image scanners,[1] and optical multiplexing systems. The design of these instruments involve an optical mask and two detectors that measure the intensity of light. The mask can either transmit light to the first detector, absorb it, or reflect it toward the second detector. The measurement of the second detector is subtracted from the first, and so these three cases correspond to weighing matrix elements of 1, 0, and −1 respectively. As this is essentially the same measurement problem as in the previous section, the usefulness of weighing matrices also applies.[1]
An orthogonal design of order
n
(s1,...,su)
si
n x n
\{0,\pmx1,...,\pmxu\}
xi
XXT=
u | |
\sum | |
i=0 |
si
2 | |
x | |
i |
This constraint is also equivalent to the rows of
X
si
xi
OD(n;s1,...,su)
Note that when weighing matrices are displayed, the symbol
-
This is a
W(2,2)
\begin{pmatrix}1&1\ 1&-\end{pmatrix}
This is a
W(4,3)
\begin{pmatrix} 1&1&1&0\\ 1&-&0&1\\ 1&0&-&-\\ 0&1&-&1\end{pmatrix}
This is a
W(7,4)
\begin{pmatrix} 1&1&1&1&0&0&0\\ 1&-&0&0&1&1&0\\ 1&0&-&0&-&0&1\\ 1&0&0&-&0&-&-\\ 0&1&-&0&0&1&-\\ 0&1&0&-&1&0&1\\ 0&0&1&-&-&1&0 \end{pmatrix}
Another
W(7,4)
\begin{pmatrix} -&1&1&0&1&0&0\\ 0&-&1&1&0&1&0\\ 0&0&-&1&1&0&1\\ 1&0&0&-&1&1&0\\ 0&1&0&0&-&1&1\\ 1&0&1&0&0&-&1\\ 1&1&0&1&0&0&- \end{pmatrix}
Which is circulant, i.e. each row is a cyclic shift of the previous row. Such a matrix is called a
CW(n,k)
n
k
1,4,9,16,...
k\leq25
CW(n,k)
k=s2
n
s
CW(n,k)
k\leq25
CW(105,36)
W(35,25)
Two weighing matrices are considered to be equivalent if one can be obtained from the other by a series of permutations and negations of the rows and columns of the matrix. The classification of weighing matrices is complete for cases where
w\leq5
n\leq15
One major open question about weighing matrices is their existence: for which values of
n
w
W(n,w)
W(n,w)
n\equiv2\pmod4
W(n,w)
w<n-1
n\equiv0\pmod4
W(n,w)
w<n
n\equiv4\pmod8
OD(n;1,1)
k<n
k
n\equiv0\pmod8
OD(n;1,k)
k<n
n\equiv2\pmod4
OD(n;1,k)
k<n-1
k=a2
a
Although the last three conjectures are statements on orthogonal designs, it has been shown that the existence of an orthogonal design
OD(n;s1,...,su)
X1,...,Xu
n
Xi
si
An equally important but often overlooked question about weighing matrices is their enumeration: for a given
n
w
W(n,w)