Hostname: page-component-5d84bcc8dc-dxv4p Total loading time: 0 Render date: 2026-08-31T14:37:57.169Z Has data issue: false hasContentIssue false

Computing in Unipotent and Reductive Algebraic Groups

Published online by Cambridge University Press:  01 February 2010

Arjeh M. Cohen
Affiliation:
Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, Netherlands, A.M.Cohen@tue.nl, http://www.win.tue.nl/~amc/
Sergei Haller
Affiliation:
btexx business technologies GmbH, Rheinstraβe 4N, 55116 Mainz, Germany, sergei@sergei-haller.de, http://www.sergei-haller.de
Scott H. Murray
Affiliation:
School of Mathematics and Statistics F07, Faculty of Science, University of Sydney, NSW 2006, Australia, murray@maths.usyd.edu.au, http://www.maths.usyd.edu.au/u/murray/

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 maximal unipotent subgroups of split reductive groups and show how this improves computation in the reductive group itself.

Information

Type
Research Article
Copyright
Copyright © London Mathematical Society 2008