V Arvind (IMSc): Some Algorithmic questions in Finite Group Theory
Tuesday 30th June 1130am--1245pm   Chair:  Meena Mahajan

A theorem of Jordan tells us that any transitive subgroup of the symmetric group
has a fixed point free element.  How efficiently can we find such an element
if the subgroup is given by a generating set?   We discuss algorithms
for this and related questions.  

The talk is primarily aimed at BSc/MSc students, and is meant as an invitation to
algorithms concerning finite groups.