On the matrix ring over a finite field

Let F_n be the ring of n × n matrices over the finite field F; let o(F_n) be the number of elements in F_n, and s(F_n) be the number of singular matrices in F_n. We prove that $\text{o(F}{}_{\mathrm{n}}\text{)<s(F}{}_{\mathrm{n}}\text{)}{}^{\mathrm{<mtext>1+1</mtext><mtext>n(n-1)</mtext>}}$ if n ? 2, and if n = 2 and o(F) ? 3, then .     

Some enumeration problems for matrices over a finite field

The probability that the product of l square matrices of size n over a finite field with q elements will be nilpotent is shown to be 1-[(qⁿ-1)/qⁿ]^l. Analogous, if less elegant, results are obtained for the product to be idempotent.     

A note on polynomial matrix functions over a finite field

Let F_n denote the ring of n×n matrices over the finite field F=GF(q) and let A(x)=A_Nx^N+ ?+ A₁x+A₀?F_n[x]. A function $\text{?:F}{}_{\mathrm{n}}\text{→F}{}_{\mathrm{n}}$ is called a right polynomial function iff there exists an A(x)?F_n[x] such that $\text{?(B)=A}{}_{\mathrm{N}}\text{B}{}^{\mathrm{N}}\text{+?+A}{}_1\text{B+ A}{}_0$ for every B?F_n. This paper obtains unique representations for and determines the number of right polynomial functions.     

Irreducible polynomials over a finite field

Dedicated to the memory of A. I. Mal'tsev.     

由整数有限域矩阵方程及其解的逆矩阵实现的新密码体系

基于整数有限域中一类矩阵方程的唯一解问题,结合能实现秘密共享的Diffie-Hellman协议,设计了一种以下三角阵的逆矩阵为明文、以对称矩阵为密文、密文信息冗余的密码体系.数值算例验证了新密码体系的可行性和正确性.     

On diameter of the commuting graph of a full matrix algebra over a finite field

It is shown that the commuting graph of a matrix algebra over a finite field has diameter at most five if the size of the matrices is not a prime nor a square of a prime. It is further shown that the commuting graph of even-sized matrices over finite field has diameter exactly four. This partially proves a conjecture stated by Akbari, Mohammadian, Radjavi, and Raja [Linear Algebra Appl. 418 (2006) 161–176].     

Some matrix functional equations

We investigate the pair of matrix functional equations G(x)F(y) = G(xy) and G(x)G(y) = F(y/x), featuring the two independent scalar variables x and y and the two N×N matrices F(z) andG(z) (with N an arbitrary positive integer and the elements of these two matrices functions of the scalar variable z). We focus on the simplest class of solutions, i.e., on matrices all of whose elements are analytic functions of the independent variable. While in the scalar (N = 1) case this pair of functional equations only possess altogether trivial constant solutions, in the matrix (N > 1) case there are nontrivial solutions. These solutions satisfy the additional pair of functional equations F(x)G(y) = G(y/x) andF(x)F(y) = F(xy), and an endless hierarchy of other functional equations featuring more than two independent variables.