Algorithm for Lang's Theorem

Simple item page
dc.creatorCohen, Arjeh M.
dc.creatorMurray, Scott H.
dc.date2005-06-03
dc.date.accessioned2026-07-07T05:20:30Z
dc.date.available2026-07-07T05:20:30Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0506068
dc.identifierhttp://arxiv.org/abs/math/0506068
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75400
dc.subjectGroup Theory
dc.subjectAlgebraic Geometry
dc.subject20G40; 20-04
dc.titleAlgorithm for Lang's Theorem
dc.typetext

Files

Collections

arXiv