A weighing matrix
is an
matrix
with entries in
satisfying
where
and
is a nonnegative integer called its weight.
Here
is the transpose, and
is the identity matrix.
Every row and column has exactly
nonzero entries, so
. The cases
and
give the zero matrix and
a Hadamard matrix, respectively (Geramita and
Seberry 1979).
For positive , the determinant identity
shows that odd
requires
to be a square number. A
Kronecker product of weighing matrices of orders
and
and weights
and
has order
and weight
.
For each fixed positive weight , a weighing matrix
exists for all sufficiently large
(Eades 1976, Ghaderpour 2016). This does not settle the uniform
conjecture that
exists for every
and every
(Formal Conjectures 2026).
Ghaderpour (2016) proved several refinements. A fixed positive weight which is a sum of two integer squares occurs in a weighing matrix of every sufficiently large
even order. When the weight is a square, the weighing matrix can be chosen to be
a symmetric matrix at every sufficiently large
order, or an antisymmetric matrix at every
sufficiently large even order. If the weight is a sum of three integer squares, an
antisymmetric matrix which is a weighing
matrix exists in every sufficiently large order divisible by 4. Every fixed positive
weight occurs in an antisymmetric matrix
which is a weighing matrix of every sufficiently large order divisible by 8. For
odd , an antisymmetric
can exist only if
is a sum of three squares.