Moore Matrices

In linear algebra, a Moore matrix, introduced by , is a matrix defined over a finite field. When it is a square matrix its determinant is called a Moore determinant (this is unrelated to the Moore determinant of a quaternionic Hermitian matrix). The Moore matrix has successive powers of the Frobenius automorphism applied to its columns (beginning with the zeroth power of the Frobenius automorphism in the first column), so it is an ''m'' × ''n'' matrix
$M=\begin \alpha_1 & \alpha_1^q & \dots & \alpha_1^\\ \alpha_2 & \alpha_2^q & \dots & \alpha_2^\\ \alpha_3 & \alpha_3^q & \dots & \alpha_3^\\ \vdots & \vdots & \ddots &\vdots \\ \alpha_m & \alpha_m^q & \dots & \alpha_m^\\ \end$
or
$M_ = \alpha_i^$
for all indices ''i'' and ''j''. (Some authors use the transpose of the above matrix.)

The Moore determinant of a square Moore matrix (so ''m'' = ''n'') can be expressed as:

$\det(V) = \prod_ \left( c_1\alpha_1 + \cdots + c_n\alpha_n \right),$

where c runs over a complete set of direction vectors, made specific by having the last non-zero entry equal to 1, i.e.,

$\det(V) = \prod_ \prod_ \left( c_1\alpha_1 + \cdots + c_\alpha_ + \alpha_i \right).$

In particular the Moore determinant vanishes if and only if the elements in the left hand column are linearly dependent over the finite field of order ''q''. So it is analogous to the Wronskian of several functions.

Dickson used the Moore determinant in finding the modular invariants of the general linear group over a finite field.

See also

* Alternant matrix
* Vandermonde matrix
* Vandermonde determinant
* List of matrices

References

*
* Chapter 1.
*

Matrices
Determinants

{{Linear-algebra-stub