We are advertising a 2 year post at the University of St Andrews, looking at improving and overhauling many of the fundamental algorithms used for permutation groups, in particular stabilizer chains and base and strong generating sets.
If you have any questions about this post, please ask. This job will be part of a larger research group, and we are happy to work with people with different specialities. In particular, there is no need to be an expert GAP programmer. Under Dr Christopher Jefferson, the role will involve the development of new algorithms for fundamental problems in computation group theory, in particular improved methods for finding, storing and modifying stabilizer chains and base and strong generating sets of permutation groups, This will also involve practical implementation and automated tuning of these algorithms. Therefore it is advantageous to have a background in the theory of permutation groups, computational group theory and algorithm design and implementation - Closes 13th March 2019. https://www.jobs.ac.uk/job/BQE428/research-fellow-ar1696sb _______________________________________________ Forum mailing list [email protected] https://mail.gap-system.org/mailman/listinfo/forum
