An algorithm for Lang's theorem.

DOI10.1016/J.JALGEBRA.2009.04.013zbMATH Open1181.20010arXivmath/0506068OpenAlexW1974262061MaRDI QIDQ731239FDOQ731239

Authors: Arjeh M. Cohen, Murray, Scott H. 

Publication date: 2 October 2009

Published in: Journal of Algebra (Search for Journal in Brave)

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.

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

Recommendations

• Algorithmic construction of Chevalley bases
• Computer construction of split Cartan subalgebras
• Recognition of finite exceptional groups of Lie type.
• scientific article; zbMATH DE number 1981751
• Black box exceptional groups of Lie type.

zbMATH Keywords

linear algebraic groupsderangementsLie algebrasWeyl groupsfinite groups of Lie typeChevalley basesLas Vegas type algorithmsmaximal toral subalgebrassplit connected reductive groupssplit reductive Lie algebras

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Lie algebras of linear algebraic groups (17B45) Linear algebraic groups over finite fields (20G40) Representations of finite groups of Lie type (20C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear algebraic groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic groups and modular Lie algebras
• Title not available (Why is that?)
• Rational tori, semisimple orbits and the topology of hyperplane complements
• Title not available (Why is that?)
• Computing Frobenius maps and factoring polynomials
• The cohomology of the regular semisimple variety
• Title not available (Why is that?)
• Writing representations over minimal fields
• Computing in groups of Lie type
• Identification of matrix generators of a Chevalley group.
• Classical groups and geometric algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing in unipotent and reductive algebraic groups.
• Algebraic groups over finite fields, a quick proof of Lang’s theorem
• Title not available (Why is that?)
• Computing Cartan subalgebras of Lie algebras
• Some results on Lie 𝑝-algebras

Cited In (7)

• Recognition of finite exceptional groups of Lie type.
• Black box exceptional groups of Lie type.
• Estimating proportions of elements in finite groups of Lie type.
• Algorithmic construction of Chevalley bases
• Computing Chevalley bases in small characteristics
• Proportions of elements with given 2-part order in finite classical groups of odd characteristic.
• The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm.

Uses Software

• Magma

This page was built for publication: An algorithm for Lang's theorem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731239)