Equivalence classes of matrices over finite fields
In a series of papers starting with the classic paper of \textit{L. Carlitz} [Trans. Am. Math. Soc. 75, 405--427 (1953; Zbl 0053.02502)], Carlitz, S. Cavior and the author have studied several forms of equivalence of functions over finite fields. In this paper the author studies an analogous problem for the ring \(F_{m\times n}\) of \(m\times n\) matrices over a finite field \(F\) of order \(q\). Let \(\Omega\) be a group of permutations of \(F\). If \(A, B \in F_{m\times n}\), then \(A\) is called equivalent to \(B\) relative to \(\Omega\) if there exists \(\Phi\) such that \(\Phi(A)=B\), i.e. if \(A= (a_{ij})\), \(B=(b_{ij})\) then \(\Phi(a_{ij})=b_{ij}\), for all \(i, j\). Formulas are determined for the number of equivalence classes of a given order and for the total number of classes induced by various permutations groups. In particular, such formulas are determined if \(\Omega\) is the symmetric group on \(q\) letters, a cyclic group, or a direct sum of cyclic groups.
- Equivalence classes of functions over a finite field
- Equivalence classes of functions over a finite field
- Equivalence classes of polynomials over finite fields
- Equivalence classes of sets of polynomials over a finite field.
- scientific article; zbMATH DE number 3135133 (Why is no real title available?)
- Invariant theory of systems of equations in a finite field
- Invariantive Theory of Equations in a Finite Field
- Weak equivalence of functions over a finite field
This page was built for publication: Equivalence classes of matrices over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146736)