Computing in unipotent and reductive algebraic groups

2006/11/01 by Arjeh M. Cohen, Cohen, Arjeh M., Sergei Haller +3
Mathematics · #20-04 (Secondary) #20G15 (Primary) 20F18 #Advanced Algebra and Geometry #Advanced Topics in Algebra #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR)

paper · pdf · doi:10.48550/arxiv.math/0611013

openalex publication_date 2006/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Constructing algebraic groups from their Lie algebras
• Generalized Green functions and unipotent classes for finite reductive groups, IV
• Constructing arithmetic subgroups of unipotent groups
• Unipotent Generators for Arithmetic Groups
• Irreducible Unipotent Numerical Monoids