caa a22 4500 388091711 CHVBK 20180307125253.0 cr unu---uuuuu 161130e199910 xx s 000 0 eng 10.1017/S000497270003639X doi S000497270003639X pii (NATIONALLICENCE)cambridge-10.1017/S000497270003639X Wall G.E. School of Mathematics and Statistics, University of Sydney, New South Wales 2006, Australia Counting cyclic and separable matrices over a finite field [Elektronische Daten] [G.E. Wall] 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. Copyright © Australian Mathematical Society 1999 Bulletin of the Australian Mathematical Society Cambridge University Press 60/2(1999-10), 253-284 0004-9727 60:2<253 1999 60 BAZ https://doi.org/10.1017/S000497270003639X text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1017/S000497270003639X text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Wall G.E. School of Mathematics and Statistics, University of Sydney, New South Wales 2006, Australia NATIONALLICENCE 773 0- Bulletin of the Australian Mathematical Society Cambridge University Press 60/2(1999-10), 253-284 0004-9727 60:2<253 1999 60 BAZ CC0 http://creativecommons.org/publicdomain/zero/1.0 nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-cambridge