ALGORITHMS TO IDENTIFY ABUNDANT p-SINGULAR ELEMENTS IN FINITE CLASSICAL GROUPS

Authors

  • Alice C Niemeyer University of Western Australia
  • Tomasz Popiel University of Western Australia
  • Cheryl Elisabeth Praeger University of Western Australia

Keywords:

finite classical groups, algorithms of group computation

Abstract

Let G be a finite d-dimensional classical group and p a prime divisor of |G| distinct from the characteristic of the natural representation. We consider a subfamily of p-singular elements in G (elements with order divisible by p) that leave invariant a subspace X of the natural G-module of dimension greater than d/2 and either act irreducibly on X or preserve a particular decomposition of X into two equal-dimensional irreducible subspaces. We proved in a recent paper that the proportion in G of these so-called p-abundant elements is at least an absolute constant multiple of the best known lower bound for the proportion of all p-singular elements. This raises the question of which subgroups of G contain p-abundant elements for more than one prime p. We hope that such information might lead to new recognition algorithms for finite classical groups. As a step towards this, here we present efficient algorithms to test whether a given element is p-abundant, both for a known prime p and for the case where p is not known a priori. DOI: 10.1017/S0004972712000317

Author Biographies

Alice C Niemeyer, University of Western Australia

Professor

Tomasz Popiel, University of Western Australia

Research associate

Cheryl Elisabeth Praeger, University of Western Australia

Winthrop Professor Federation Fellow

Published

2012-06-25

Issue

Section

Articles