𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Invariants of 2×2-Matrices over Finite Fields

✍ Scribed by Larry Smith


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
114 KB
Volume
8
Category
Article
ISSN
1071-5797

No coin nor oath required. For personal study only.

✦ Synopsis


Let F q be the finite field with q elements, q ¼ p n ; p 2 N a prime, and Mat 2:2 ðF q Þ the vector space of 2 Â 2-matrices over F. The group GLð2; FÞ acts on Mat 2;2 ðF q Þ by conjugation. In this note, we determine the invariants of this action. In contrast to the case of an infinite field, where the trace and determinant generate the ring of invariants, several new invariants appear in the case of finite fields. # 2002 Elsevier Science (USA)

This manuscript was motivated by review [12] of paper [1], which piqued my interest once again in what is after all one of the oldest and most basic problems in invariant theory: namely, determine all the polynomials in the entries of a generic n  n-matrix that are constant on similarity classes. In the language of modern invariant theory 1 this may be expressed as follows: let F be a field and Mat n;n ðFÞ the vector space of n  n-matrices over F. The general linear group GLðn; FÞ acts on Mat n;n ðFÞ by conjugation, and hence also on the polynomial algebra F½Mat n;n ðFÞ on the dual vector space Mat n;n ðFÞ * . What is being asked for is a description of the ring of invariants F½Mat n;n ðFÞ GLðn;FÞ .

As is well known, if the ground field is an algebraically closed field, such as the complex numbers, the only such functions are symmetric polynomials of the eigenvalues of the matrix entries (see e.g., [10, Chap. 19] or 1 We refer to [9] for basic material on invariant theory.


📜 SIMILAR VOLUMES


Similarity to Symmetric Matrices over Fi
✍ Joel V. Brawley; Timothy C. Teitloff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 299 KB

It has been known for some time that every polynomial with coefficients from a finite field is the minimum polynomial of a symmetric matrix with entries from the same field. What have remained unknown, however, are the possible sizes for the symmetric matrices with a specified minimum polynomial and

q-Rook Polynomials and Matrices over Fin
✍ James Haglund 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Connections between q-rook polynomials and matrices over finite fields are exploited to derive a new statistic for Garsia and Remmel's q-hit polynomial. Both this new statistic mat and another statistic for the q-hit polynomial recently introduced by Dworkin are shown to induce different multiset Ma

Cyclic Matrices in Classical Groups over
✍ Peter M. Neumann; Cheryl E. Praeger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 362 KB

to helmut wielandt for his 90th birthday with much respect and many congratulations , where m X t is its minimal polynomial and c X t is its characteristic polynomial det tI -X . This condition is equivalent to requiring the vector space F d of 1 × d row vectors over F to be cyclic as an F X -modul

The rank of sparse random matrices over
✍ Johannes Blömer; Richard Karp; Emo Welzl 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 2 views

Let M be a random n = n -matrix over GF q such that for each entry M in i j w x Ž . M and for each nonzero field element ␣ the probability Pr M s ␣ is pr q y 1 , where i j ## Ž . p slog n y c rn and c is an arbitrary but fixed positive constant. The probability for a Ž . matrix entry to be zero