Department of Mathematics

Indian Institute Of Technology Madras , Chennai

Efficient permutation group computation

Speaker : Prof V Arvind, IMSc, Chennai


Abstract :

Given a subgroup $G$ of $S_n$ by a generating set and an element $g in S_n$, we will discuss an efficient algorithms for testing if $g$ is in $G$. As a consequence, we will be able to solve a number of other algorithmic problems, e.g. solvability and nilpotence testing, random sampling from $G$.

Key Speaker Prof V Arvind, IMSc, Chennai
Place Madhava Hall
Start Time 3:00 PM
Finish Time 4:00 PM
External Link None