Towards an efficient meat-axe algorithm using \(f\)-cyclic matrices: The density of uncyclic matrices in M\((n,q)\)
From MaRDI portal
Publication:731244
DOI10.1016/j.jalgebra.2009.02.021zbMath1179.65005OpenAlexW2083277604WikidataQ56987737 ScholiaQ56987737MaRDI QIDQ731244
Cheryl E. Praeger, Stephen P. Glasby
Publication date: 2 October 2009
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2009.02.021
Monte Carlo algorithmcomplexity analysis\(f\)-cyclic matricesmeat-axe algorithmNorton's irreducibility testuncyclic matrices
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The cycle structure of a linear transformation over a finite field
- A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
- The Magma algebra system. I: The user language
- Some asymptotic results on finite vector spaces
- The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices
- Computing Minimal Polynomials of Matrices
- Cycle indices for the finite classical groups
- Treating the Exceptional Cases of the MeatAxe
- Counting cyclic and separable matrices over a finite field
- Cyclic Matrices Over Finite Fields
- A generating function approach to the enumeration of matrices in classical groups over finite fields
This page was built for publication: Towards an efficient meat-axe algorithm using \(f\)-cyclic matrices: The density of uncyclic matrices in M\((n,q)\)