Abstract
In this note we give a polynomial time algorithm to compute the order of the centralizer of a given subgroup of a full linear group over a finite field. The method is deterministic if the characteristic of the ground field is small and Las Vegas in the general case. As an application we whow that the verification of the center of a linear group over a finite field belongs to the complexity class AM. This settles a question of L. Babai.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
