Page 1 Conference Board of the Mathematical Sciences CBMS Regional Conference Series in
Mathematics Number 25 Relation Modules of Finite Groups Karl W. Gruenberg American …

The “product replacement algorithm” is a commonly used heuristic to generate random
group elements in a finite group $ G $, by running a random walk on generating $ k $-tuples …

Theproduct replacement algorithm is a commonly used heuristic to generate random group
elements in a finite group G, by running a random walk on generating k-tuples of G. While …

Let $ G $ be a finite simple group. We show that the commutator map $\alpha: G\times
G\rightarrow G $ is almost equidistributed as $\vert G\vert\rightarrow\infty $. This somewhat …

Let G and F be groups. A G-defining subgroup of F is a normal subgroup N of F such that F/N
is isomorphic to G. The automorphism group Aut (F) acts on the set of G-defining subgroups …

Pro-finite Presentations Page 1 Ž . Journal of Algebra 242, 672690 2001 doi:10.1006rjabr.2001.8805,
available online at http:rrwww.idealibrary.com on Pro-finite Presentations Alexander …

Nielsen equivalence and simple-homotopy equivalence are interpreted as analogues in
dimensions 1 and 2 respectively. This yields the following results. § 1. A new method for …

T-systems of certain finite simple groups Page 1 Math. Proc. Camb. Phil. Soc. (1993), 113, 9 9
Printed in Great Britain T-systems of certain finite simple groups BY MARTIN J. EVANS …

PERSI DIACONIS(STANFORD, CALIFORNIA) AND RONALD GRAHAM(FLORHAM PARK,
NEW JERSEY) 1. Introduction. Let G be a finite abelian group. By the fundamental theorem …