Computing in unipotent and reductive algebraic groups

Arjeh M. Cohen, Sergei Haller, Scott H. Murray

Abstract

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup of a split reductive group and show how this improves computation in the reductive group itself.

Keywords: Linear Algebraic Groups, Nilpotent Groups, Unipotent Group, Collection Algorithms.

AMS Subject Classification: Primary 20G15; secondary 20F18, 20-04.