Weighing matrix

Weighing matrices are so called because of their use in optimally measuring the individual weights of multiple objects[1][2]

In mathematics, a weighing matrix of order [math]\displaystyle{ n }[/math] and weight [math]\displaystyle{ w }[/math] is a matrix [math]\displaystyle{ W }[/math] with entries from the set [math]\displaystyle{ \\{0, 1, -1\\} }[/math] such that:

[math]\displaystyle{ WW^\mathsf{T} = wI_n }[/math]

Where [math]\displaystyle{ W^\mathsf{T} }[/math] is the transpose of [math]\displaystyle{ W }[/math] and [math]\displaystyle{ I_n }[/math] is the identity matrix of order [math]\displaystyle{ n }[/math]. The weight [math]\displaystyle{ w }[/math] is also called the degree of the matrix. For convenience, a weighing matrix of order [math]\displaystyle{ n }[/math] and weight [math]\displaystyle{ w }[/math] is often denoted by [math]\displaystyle{ W(n,w) }[/math].[3]

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.[1][2]

## Contents

* 1 Properties
* 2 Applications
* 2.1 Experiment design
* 2.2 Optical measurement
* 3 Examples
* 4 Equivalence
* 5 Open Questions
* 6 References

## Properties

Some properties are immediate from the definition. If [math]\displaystyle{ W }[/math] is a [math]\displaystyle{ W(n,w) }[/math], then:

* The rows of [math]\displaystyle{ W }[/math] are pairwise orthogonal (that is, every pair of rows you pick from [math]\displaystyle{ W }[/math] will be orthogonal). Similarly, the columns are pairwise orthogonal.
* Each row and each column of [math]\displaystyle{ W }[/math] has exactly [math]\displaystyle{ w }[/math] non-zero elements.
* [math]\displaystyle{ W^\mathsf{T}W = w I }[/math], since the definition means that [math]\displaystyle{ W^{-1} = w^{-1}W^\mathsf{T} }[/math], where [math]\displaystyle{ W^{-1} }[/math] is the inverse of [math]\displaystyle{ W }[/math].
* [math]\displaystyle{ \det(W) = \pm w^{n/2} }[/math] where [math]\displaystyle{ \det(W) }[/math] is the determinant of [math]\displaystyle{ W }[/math].

A weighing matrix is a generalization of Hadamard matrix, which does not allow zero entries.[3] As two special cases, a [math]\displaystyle{ W(n,n) }[/math] is a Hadamard matrix[3] and a [math]\displaystyle{ W(n,n-1) }[/math] is equivalent to a conference matrix.

## Applications

### Experiment design

Weighing matrices take their name from the problem of measuring the weight of multiple objects. If a measuring device has a statistical variance of [math]\displaystyle{ \sigma^2 }[/math], then measuring the weights of [math]\displaystyle{ N }[/math] objects and subtracting the (equally imprecise) tare weight will result in a final measurement with a variance of [math]\displaystyle{ 2\sigma^2 }[/math].[4] It is possible to increase the accuracy of the estimated weights by measuring different subsets of the objects, especially when using a balance scale where objects can be put on the opposite measuring pan where they subtract their weight from the measurement.

An order [math]\displaystyle{ n }[/math] matrix [math]\displaystyle{ W }[/math] can be used to represent the placement of [math]\displaystyle{ n }[/math] objects—including the tare weight—in [math]\displaystyle{ n }[/math] trials. Suppose the left pan of the balance scale adds to the measurement and the right pan subtracts from the measurement. Each element of this matrix [math]\displaystyle{ w_{ij} }[/math] will have:

[math]\displaystyle{ w_{ij} = \begin{cases} 0 & \text{if on the }i\text{th trial the }j\text{th object was not measured} \\\ 1 & \text{if on the }i\text{th trial the }j\text{th object was placed in the left pan} \\\ -1 & \text{if on the }i\text{th trial the }j\text{th object was placed in the right pan } \\\ \end{cases} }[/math]

Let [math]\displaystyle{ \bold{x} }[/math] be a column vector of the measurements of each of the [math]\displaystyle{ n }[/math] trials, let [math]\displaystyle{ \bold{e} }[/math] be the errors to these measurements each independent and identically distributed with variance [math]\displaystyle{ \sigma^2 }[/math], and let [math]\displaystyle{ \bold{y} }[/math] be a column vector of the true weights of each of the [math]\displaystyle{ n }[/math] objects. Then we have:

[math]\displaystyle{ \bold{x} = W\bold{y} + \bold{e} }[/math]

Assuming that [math]\displaystyle{ W }[/math] is non-singular, we can use the method of least-squares to calculate an estimate of the true weights:

[math]\displaystyle{ \bold{y} = (W^T W)^{-1} W \bold{x} }[/math]

The variance of the estimated [math]\displaystyle{ \bold{y} }[/math] vector cannot be lower than [math]\displaystyle{ \tfrac{\sigma^2}{n} }[/math], and will be minimum if and only if [math]\displaystyle{ W }[/math] is a weighing matrix.[4][5]

### Optical measurement

An optical mask (3) based on a weighing matrix is used in the measurement of the spectrum of incoming light (4). Depending on the corresponding element of the matrix, the light is either absorbed, or passed to one of two intensity detectors (1,2).[6]

Weighing matrices appear in the engineering of spectrometers, image scanners,[6] and optical multiplexing systems.[5] 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.[6]

## Examples

Note that when weighing matrices are displayed, the symbol [math]\displaystyle{ - }[/math] is used to represent −1. Here are some examples:

This is a [math]\displaystyle{ W(2,2) }[/math]:

[math]\displaystyle{ \begin{pmatrix}1 & 1 \\\ 1 & -\end{pmatrix} }[/math]

This is a [math]\displaystyle{ W(4,3) }[/math]:

[math]\displaystyle{ \begin{pmatrix} 1 & 1 & 1 & 0 \\\ 1 & \- & 0 & 1 \\\ 1 & 0 & \- & \- \\\ 0 & 1 & \- & 1 \end{pmatrix} }[/math]

This is a [math]\displaystyle{ W(7,4) }[/math]:

[math]\displaystyle{ \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} }[/math]

Another [math]\displaystyle{ W(7,4) }[/math]:

[math]\displaystyle{ \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} }[/math]

Which is cyclic, namely, each row is a cyclic shift of the previous row. Such a matrix is called a [math]\displaystyle{ CW(n,k) }[/math] and is determined by its first row. Circulant weighing matrices are of special interest since their algebraic structure makes them easier for classification. Indeed, we know that a circulant weighing matrix of order [math]\displaystyle{ n }[/math] and weight [math]\displaystyle{ k }[/math] must be of square weight. So, weights [math]\displaystyle{ 1,4,9,16,... }[/math] are permissible and weights [math]\displaystyle{ k \leq 25 }[/math] have been completely classified.[7] Two special (and actually, extreme) cases of circulant weighing matrices are (A) circulant Hadamard matrices which are conjectured not to exist unless their order is less than 5. This conjecture, circulant Hadamard conjecture first raised by Ryser is known to be true for many orders but is still open. (B) [math]\displaystyle{ CW(n,k) }[/math] of weight [math]\displaystyle{ k=s^2 }[/math] and minimal order [math]\displaystyle{ n }[/math] exist if [math]\displaystyle{ s }[/math] is a power of a prime and such a circulant weighing matrix can be obtained by signing the complement of a finite projective plane. Since all [math]\displaystyle{ CW(n,k) }[/math] for [math]\displaystyle{ k\leq 25 }[/math] have been classified, the first open case is [math]\displaystyle{ CW(105,36) }[/math]. The first open case for a general weighing matrix (certainly not a circulant) is [math]\displaystyle{ W(35,25) }[/math].

## Equivalence

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 [math]\displaystyle{ w }[/math] ≤ 5 as well as all cases where [math]\displaystyle{ n }[/math] ≤ 15 are also completed.[8] However, very little has been done beyond this with exception to classifying circulant weighing matrices.[9][10]

## Open Questions

This section possibly contains synthesis of material which does not verifiably mention or relate to the main topic. (November 2019) (Learn how and when to remove this template message)

|

There are many open questions about weighing matrices. The main question about weighing matrices is their existence: for which values of [math]\displaystyle{ n }[/math] and [math]\displaystyle{ w }[/math] does there exist a [math]\displaystyle{ W(n,w) }[/math]? A great deal about this is unknown. An equally important but often overlooked question about weighing matrices is their enumeration: for a given [math]\displaystyle{ n }[/math] and [math]\displaystyle{ w }[/math], how many [math]\displaystyle{ W(n,w) }[/math]'s are there?

This question has two different meanings. Enumerating up to equivalence and enumerating different matrices with same n,k parameters. Some papers were published on the first question but none were published on the second important question.

## References

1. ↑ 1.0 1.1 Raghavarao, Damaraju (1960). "Some Aspects of Weighing Designs". The Annals of Mathematical Statistics (Institute of Mathematical Statistics) 31 (4): 878–884. doi:10.1214/aoms/1177705664. ISSN 0003-4851.
2. ↑ 2.0 2.1 Seberry, Jennifer (2017). "Some Algebraic and Combinatorial Non-existence Results". Orthogonal Designs. Cham: Springer International Publishing. pp. 7–17. doi:10.1007/978-3-319-59032-5_2. ISBN 978-3-319-59031-8.
3. ↑ 3.0 3.1 3.2 Geramita, Anthony V.; Pullman, Norman J.; Wallis, Jennifer S. (1974). "Families of weighing matrices". Bulletin of the Australian Mathematical Society (Cambridge University Press (CUP)) 10 (1): 119–122. doi:10.1017/s0004972700040703. ISSN 0004-9727.
4. ↑ 4.0 4.1 Raghavarao, Damaraju (1971). "Weighing Designs". Constructions and combinatorial problems in design of experiments. New York: Wiley. pp. 305–308. ISBN 978-0471704850. https://archive.org/details/constructionscom0000ragh.
5. ↑ 5.0 5.1 Koukouvinos, Christos; Seberry, Jennifer (1997). "Weighing matrices and their applications". Journal of Statistical Planning and Inference (Elsevier BV) 62 (1): 91–101. doi:10.1016/s0378-3758(96)00172-3. ISSN 0378-3758.
6. ↑ 6.0 6.1 6.2 Sloane, Neil J. A.; Harwit, Martin (1976-01-01). "Masks for Hadamard transform optics, and weighing designs". Applied Optics (The Optical Society) 15 (1): 107. doi:10.1364/ao.15.000107. ISSN 0003-6935.
7. ↑ Arasu, K.T.; Gordon, Daniel M.; Zhang, Yiran. New Nonexistence Results on Circulant Weighing Matrices.
8. ↑ Harada, Masaaki; Munemasa, Akihiro (2012). "On the classification of weighing matrices and self-orthogonal codes". J. Combin. Designs 20: 40–57. doi:10.1002/jcd.20295.
9. ↑ Ang, Miin Huey; Arasu, K.T.; Lun Ma, Siu; Strassler, Yoseph (2008). "Study of proper circulant weighing matrices with weight 9". Discrete Mathematics 308 (13): 2802–2809. doi:10.1016/j.disc.2004.12.029.
10. ↑ Arasu, K.T.; Hin Leung, Ka; Lun Ma, Siu; Nabavi, Ali; Ray-Chaudhuri, D.K. (2006). "Determination of all possible orders of weight 16 circulant weighing matrices". Finite Fields and Their Applications 12 (4): 498–538. doi:10.1016/j.ffa.2005.06.009.

* v
* t
* e

Matrix classes

Explicitly constrained entries|

* (0,1)
* Alternant
* Anti-diagonal
* Anti-Hermitian
* Anti-symmetric
* Arrowhead
* Band
* Bidiagonal
* Binary
* Bisymmetric
* Block-diagonal
* Block
* Block tridiagonal
* Boolean
* Cauchy
* Centrosymmetric
* Conference
* Complex Hadamard
* Copositive
* Diagonally dominant
* Diagonal
* Discrete Fourier Transform
* Elementary
* Equivalent
* Frobenius
* Generalized permutation
* Hadamard
* Hankel
* Hermitian
* Hessenberg
* Hollow
* Integer
* Logical
* Markov
* Metzler
* Monomial
* Moore
* Nonnegative
* Partitioned
* Parisi
* Pentadiagonal
* Permutation
* Persymmetric
* Polynomial
* Positive
* Quaternionic
* Sign
* Signature
* Skew-Hermitian
* Skew-symmetric
* Skyline
* Sparse
* Sylvester
* Symmetric
* Toeplitz
* Triangular
* Tridiagonal
* Unitary
* Vandermonde
* Walsh
* Z

Constant|

* Exchange
* Hilbert
* Identity
* Lehmer
* Of ones
* Pascal
* Pauli
* Redheffer
* Shift
* Zero

Conditions on eigenvalues or eigenvectors|

* Companion
* Convergent
* Defective
* Diagonalizable
* Hurwitz
* Positive-definite
* Stability
* Stieltjes

Satisfying conditions on products or inverses|

* Congruent
* Idempotent or Projection
* Invertible
* Involutory
* Nilpotent
* Normal
* Orthogonal
* Orthonormal
* Singular
* Unimodular
* Unipotent
* Totally unimodular
* Weighing

With specific applications|

* Adjugate
* Alternating sign
* Augmented
* Bézout
* Carleman
* Cartan
* Circulant
* Cofactor
* Commutation
* Confusion
* Coxeter
* Derogatory
* Distance
* Duplication
* Elimination
* Euclidean distance
* Fundamental (linear differential equation)
* Generator
* Gramian
* Hessian
* Householder
* Jacobian
* Moment
* Payoff
* Pick
* Random
* Rotation
* Seifert
* Shear
* Similarity
* Symplectic
* Totally positive
* Transformation
* Wedderburn
* X–Y–Z

Used in statistics|

* Bernoulli
* Centering
* Correlation
* Covariance
* Design
* Dispersion
* Doubly stochastic
* Fisher information
* Hat
* Precision
* Stochastic
* Transition

Used in graph theory|

* Adjacency
* Biadjacency
* Degree
* Edmonds
* Incidence
* Laplacian
* Seidel adjacency
* Skew-adjacency
* Tutte

Used in science and engineering|

* Cabibbo–Kobayashi–Maskawa
* Density
* Fundamental (computer vision)
* Fuzzy associative
* Gamma
* Gell-Mann
* Hamiltonian
* Irregular
* Overlap
* S
* State transition
* Substitution
* Z (chemistry)

Related terms|

* Jordan canonical form
* Linear independence
* Matrix exponential
* Matrix representation of conic sections
* Perfect matrix
* Pseudoinverse
* Quaternionic matrix
* Row echelon form
* Wronskian

* List of matrices
* Category:Matrices

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Weighing matrix. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Weighing_matrix&oldid=3208833"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template