Preprint

Algorithm for Lang's Theorem

Arjeh M. Cohen, Scott H. Murray


Abstract

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie type. We use an algorithm for computing a Chevalley basis for a split reductive Lie algebra, which is of independent interest.

This paper is available as a pdf (312kB) file.

Tuesday, May 6, 2008