Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-23T02:59:01.756Z Has data issue: false hasContentIssue false
  • English
  • Français

Counting cyclic and separable matrices over a finite field

Published online by Cambridge University Press:  17 April 2009

G.E. Wall
G.E. Wall
Affiliation:
School of Mathematics and Statistics, University of Sydney, New South Wales 2006, Australia
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A square matrix is called cyclic if its characteristic and minimum polynomials coincide, separable if the characteristic polynomial has no repeated roots. Recent results of P. Neumann and Praeger, and of Lehrer, about the numbers of such matrices over a finite field are sharpened.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 60 , Issue 2 , October 1999 , pp. 253 - 284
Copyright
Copyright © Australian Mathematical Society 1999

References

[1]Lehrer, G.I., ‘The cohomology of the regular semisimple variety’, J. Algebra 199 (1998), 666–689.CrossRefGoogle Scholar
[2]Lehrer, G.I. and Segal, G.B., ‘Homology stability for classical regular semisimple varieties’, (Report 98–27 (September 1998), School of Mathematics and Statistics, University of Sydney).Google Scholar
[3]Neumann, P.M. and Praeger, C.E., ‘Cyclic matrices over finite fields’, J. London Math. Soc. (2) 52 (1995), 263–284.Google Scholar