Constructive Sylow theorems for the classical groups. (Q2464490): Difference between revisions

The author provides efficient algorithms to construct and solve the conjugacy problem for the Sylow \(r\)-subgroups of the classical groups over finite fields in their natural representation, where \(r\) is a prime. That is to say the following problems: (1) Write down generators for a Sylow \(r\)-subgroup; (2) Given \(P,S\in\text{Syl}_r(G)\) find \(g\in G\) such that \(P^g=S\); (3) Given \(P\in\text{Syl}_r(G)\) compute \(N_G(P)\). The algorithms described here are implemented in the Magma computer algebra system.