Biased tadpoles: a fast algorithm for centralizers in large matrix groups

DOI10.1145/1576702.1576734MaRDI QIDQ2883820zbMATH OpenOpenAlexFDO

Authors Daniel Kunkle, Gene Cooperman

Publication date 13 May 2012

Published in Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1576702.1576734

Mathematics Subject Classification ID

Basic linear algebra (15A99) Software, source code, etc. for problems pertaining to group theory (20-04) Other groups of matrices (20H99) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing the order of centralizers in linear groups
• Finding central decompositions of p-groups.
• An improvement to the centralizer algorithm for permutation groups
• scientific article; zbMATH DE number 1004941
• scientific article; zbMATH DE number 1981751

Cited in

(1)

• A note on computing involution centralizers.

This page was built for publication: Biased tadpoles: a fast algorithm for centralizers in large matrix groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883820)