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
Cyclic Matrices in Classical Groups over Finite Fields
β Scribed by Peter M. Neumann; Cheryl E. Praeger
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 362 KB
- Volume
- 234
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
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 -module. In a previous paper we showed that most d Γ d matrices over a finite field F are cyclic. The present work is a continuation of that. Its aim is to obtain good lower bounds on the proportion of cyclic matrices in the general linear group GL d F and in various important subgroups of it. Although our motivation originated in our work on the design and analysis of algorithms for computing efficiently in matrix groups, the results have turned out to be of independent interest.
Define Cyc d q to be the set of cyclic matrices in M d q , and define Noncyc d q to be the set of non-cyclic matrices. The proportion Noncyc d q Γ· q d 2 may be naturally thought of as the probability that a randomly chosen d Γ d matrix is not cyclic. In we proved that Prob X β M d q is non-cyclic = q -3 + O q -4
π SIMILAR VOLUMES
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
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
Let G be PSΒΈL(q), PSΒΊ L (q), Sp L (q) or PSp L (q), where q is a power of the prime p. Using results on the numbers of special squarefree polynomials over finite fields, we describe and count the conjugacy classes of p-elements with abelian centralizers in G. Similar results are obtained for the sem
Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.
We study the geometrical properties of the subgroups of the mutliplicative group of a "nite extension of a "nite "eld endowed with its vector space structure and we show that in some cases the associated projective space has a natural group structure. We construct some cyclic codes related to Reed}M