Bounding lengths of subgroup series for finite permutation and matrix groups

点击翻译按钮获取中文摘要

This project lies in the EPSRC research area Algebra.It is motivated by attempts to estimate the theoretical complexity of various algorithms for carrying out practical computations in finite permutation and matrix groups. This complexity is to a large extent determined by a number of properties of the group involved, such as the number of elements required to generate it, or the maximum lengths of various types of chains of subgroups of the group, such as a composition or chief series. There are many results of this type in the literature, although many them are stated in terms of orders of magnitude rather being precise. For some of the applications to algorithms it is necessary to have precise results.The aims of the project are to prove theorems providing precise bounds on various types of series. Some of these results will be estimating constants involved in existing results providing orders of magnitude, and others will be results on different types of series that have not been previously investigated. It is possible that the student will go on to investigate specific applications to algorithms and possibly design (and perhaps implement, depending on whether he is good at writing computer code) new algorithms or improve existing ones.The applications are to computational group theory. Many of the associated algorithms, such as determining the structure of the groups involved, are used in computations in other branches of mathematics, such as number theory, Galois theory, algebraic geometry, and mathematical cryptography.The project is in keeping with the EPSRC strategy of supporting the development of a research and training portfolio in the area of Algebra that sustains the UK's current position, and it builds on key strengths in computational finite group theory.