کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4586693 1334110 2009 28 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
An algorithm for Lang's Theorem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
An algorithm for Lang's Theorem
چکیده انگلیسی

We give an efficient Las Vegas type 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. For our time analysis we derive that the proportion of reflection derangements in a Weyl group is less than 2/3.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Algebra - Volume 322, Issue 3, 1 August 2009, Pages 675-702