In mathematics, a matrix of ones or all-ones matrix has every entry equal to one.[1] Examples of standard notation are given below:
J2=\begin{pmatrix} 1&1\\ 1&1\end{pmatrix}; J3=\begin{pmatrix} 1&1&1\\ 1&1&1\\ 1&1&1 \end{pmatrix}; J2,5=\begin{pmatrix} 1&1&1&1&1\\ 1&1&1&1&1\end{pmatrix}; J1,2=\begin{pmatrix} 1&1\end{pmatrix}.
Some sources call the all-ones matrix the unit matrix, but that term may also refer to the identity matrix, a different type of matrix.
A vector of ones or all-ones vector is matrix of ones having row or column form; it should not be confused with unit vectors.
For an matrix of ones J, the following properties hold:
(x-n)xn-1
x2-nx
Jk=nk-1J
k=1,2,\ldots.
When J is considered as a matrix over the real numbers, the following additional properties hold:
\tfrac1nJ
\exp(\muJ)=I+
e\mu-1 | |
n |
J
The all-ones matrix arises in the mathematical field of combinatorics, particularly involving the application of algebraic methods to graph theory. For example, if A is the adjacency matrix of an n-vertex undirected graph G, and J is the all-ones matrix of the same dimension, then G is a regular graph if and only if AJ = JA.[6] As a second example, the matrix appears in some linear-algebraic proofs of Cayley's formula, which gives the number of spanning trees of a complete graph, using the matrix tree theorem.