Calculating the set of orders of elements in the finite linear groups

DOI10.1080/09720529.2007.10698145zbMath1154.20040OpenAlexW2313336701MaRDI QIDQ3545834

Y. Farjami, Mohammad-Reza Darafsheh

Publication date: 11 December 2008

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2007.10698145

zbMATH Keywords

algorithmsgeneral linear groupsfinite fieldsspecial linear groupselement orders

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

ON THE RECOGNITION OF THE SIMPLE GROUPS L₇(3) AND L₈(3) BY THE SPECTRUM ⋮ Characterization of the group \(G_2(5)\) by the prime graph ⋮ OD-characterization of all finite nonabelian simple groups with orders having prime divisors at most 13. ⋮ Unnamed Item

Cites Work

• On the deterministic complexity of factoring polynomials over finite fields
• A new polynomial factorization algorithm and its implementation
• The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
• A characteristic property ofA 8
• Probabilistic Algorithms in Finite Fields
• Fast construction of irreducible polynomials over finite fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item