Computing the order of centralizers in linear groups

DOI10.1016/0890-5401(91)90064-9zbMath0761.20023OpenAlexW2071772182MaRDI QIDQ1174860

Lajos Rónyai

Publication date: 25 June 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90064-9

zbMATH Keywords

centercentralizerpolynomial time algorithmlinear group over a finite field

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear algebraic groups over finite fields (20G40) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Related Items (3)

Algorithms for Group Isomorphism via Group Extensions and Cohomology ⋮ Two-closure of rank \(3\) groups in polynomial time ⋮ CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS

Cites Work

• Computing the structure of finite algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the order of centralizers in linear groups