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.
Abstract. We describe two methods for computing with the elements of untwisted groups of Lie type: using the Steinberg presentation and using highest weight representations. We give algorithms for element arithmetic within the Steinberg presentation. Conversion between this presentation and linear representations is achieved using a new generalisation of row and column reduction.
We present new variations on the product replacement method for generating random elements in a black box group, together with some basic analysis and conjectures.
We demonstrate a relationships between the representation theory of Borel subgroups and parabolic subgroups of general linear groups. In particular, we show that the representations of Borel subgroups could be computed from representations of certain maximal parabolic subgroups.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.