Advanced search
Publication Cover
Communications in Algebra Volume 23, 1995 - Issue 13
Submit an article Journal homepage
112
Views
90
CrossRef citations to date
0
Altmetric
Original Articles

Generating random elements of a finite group

Frank Celler Lehrstuhl D für Mathematik, RWTH, Aachen, 52062, Germany
,
Charles R. Leedham-Green School of Mathematical Sciences, Queen Mary and Westfield College, University of London, London, United Kingdom, El 4NS
,
Scott H. Murray Department of Mathematics, University of Chicago, Chicago, IL, 60637, USA
,
Alice C. Niemeyer Mathematics Department, University of Western Australia, Nedlands, WA, 6009, Australia
&
E.A. O'brien Centre for Mathematics and its Applications, School of Mathematical Sciences, Australian National University, ACT, 0200, Australia
Pages 4931-4948 | Received 01 Feb 1995, Published online: 27 Jun 2007
 
Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days

Abstract

We present a "Practical" algorithm to construct random elements of a finite group. We analyse its theoretical behaviour and prove that asymptotically it produces uniformly distributed tuples of elements. We discuss tests to assess its effectiveness and use these to decide when its results are acceptable for some matrix groups.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related Research Data

Moderate growth and random walk on finite groups
Source: Springer Science and Business Media LLC
The probability of generating a finite classical group
Source: Springer Science and Business Media LLC
Walks on generating sets of Abelian groups
Source: Springer Science and Business Media LLC
Deciding finiteness of matrix groups in deterministic polynomial time
Source: ACM Press
First-order differential power analysis on the duplication method
Source: Springer Berlin Heidelberg
The Subgroup Structure of the Finite Classical Groups
Source: Cambridge University Press
Comparison Techniques for Random Walk on Finite Groups
Source: Institute of Mathematical Statistics
A Recognition Algorithm for Special Linear Groups
Source: Wiley
On the maximal subgroups of the finite classical groups
Source: Springer Science and Business Media LLC
Random Number Generation and Quasi-Monte Carlo Methods
Source: Society for Industrial and Applied Mathematics

Linking provided by 

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.