Computing in Unipotent and Reductive Algebraic Groups

DOI10.1112/S1461157000000632zbMath1225.20037arXivmath/0611013MaRDI QIDQ3091970

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

Publication date: 15 September 2011

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0611013

zbMATH Keywords

algebraic groupsunipotent groupsword problemfinitely generated nilpotent groupseffective algorithmsnormal form theoremssplit reductive groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over arbitrary fields (20G15) Nilpotent groups (20F18) Software, source code, etc. for problems pertaining to group theory (20-04) Group schemes (14L15)

Related Items (7)

Integral group actions on symmetric spaces and discrete duality symmetries of supergravity theories ⋮ Constructive homomorphisms for classical groups. ⋮ Double centralizers of unipotent elements in simple algebraic groups of type \(G_2\), \(F_4\) and \(E_6\). ⋮ Moufang Sets and Structurable Division Algebras ⋮ Calculations in exceptional groups over rings. ⋮ An algorithm for Lang's theorem. ⋮ Linear groups and computation

Uses Software

• Magma

Cites Work

• Some rationality questions on algebraic groups
• Collection from the left and other strategies
• Collection from the left
• The Magma algebra system. I: The user language
• Symbolic Collection using Deep Thought
• A Characterization of a Special Ordering in a Root System
• Computing in groups of Lie type
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing in Unipotent and Reductive Algebraic Groups