In this paper we establish a congruence on the degree of the map from a component of a
Hurwitz space of covers of elliptic curves to the moduli stack of elliptic curves …

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 …

To every Q Q-irreducible representation r of a finite group H, there corresponds a simple
factor A of QHQH with an involution τ τ. To this pair (A, τ)(A, τ), we associate an arithmetic …

Let F n be the free group on n≥ 2 elements and Aut (F n) its group of automorphisms. In this
paper we present a rich collection of linear representations of Aut (F n) arising through the …

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 …

The product replacement algorithm is a heuristic designed to generate random group
elements. The idea is to run a random walk on generating/spl kappa/-tuples of the group …

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 …