### Abstract

We estimate the proportion of several classes of elements in finite classical groups which are readily recognised algorithmically, and for which some power has a large fixed point subspace and acts irreducibly on a complement of it. The estimates are used in complexity analyses of new recognition algorithms for finite classical groups in arbitrary characteristic.

Original language | English |
---|---|

Pages (from-to) | 303-312 |

Journal | Discrete Mathematics and Theoretical Computer Science |

Volume | 16 |

Issue number | 1 |

Publication status | Published - Apr 2014 |