Finite Groups and Probabilistic CombinatoricsAkos SeressThe Ohio State University
April 19,

ABSTRACT


A number of combinatorial problems with the symmetric group
can be resolved using probabilistic methods. In this talk we
discuss some of these of problems, including the following two:
Applications include recognition algorithms for finite groups, and a connection to Magnus's conjecture about a residual property of free groups. The talk assumes no group theoretic background and should be accessible to a general audience. 
Combinatorics Seminar, Mathematics Department, MIT, sara(atsign)math.mit.edu 

