The construction of finite soluble factor groups of finitely presented groups and its application

Group theory--Data processing;Finite groups;Presentation of groups (Mathematics)

Wegner, Alexander ; Robertson, E. F. ; Robertson, E. F.

University:University of St Andrews

Department:Mathematics & Statistics (School of)

关键词: Group theory--Data processing;    Finite groups;    Presentation of groups (Mathematics);   

Others  :  https://research-repository.st-andrews.ac.uk/bitstream/handle/10023/12600/AlexanderWegnerPhDThesis.pdf?sequence=2&isAllowed=y

来源: DR-NTU

【 摘 要 】

Computational group theory deals with the design, analysis and computer implementation of algorithms for solving computational problems involving groups, and with the applications of the programs produced to interesting questions in group theory, in other branches of mathematics, and in other areas of science.This thesis describes an implementation of a proposal for a Soluble Quotient Algorithm, i.e. a description of the algorithms used and a report on the findings of an empirical study of the behaviour of the programs, and gives an account of an application of the programs.The programs were used for the construction of soluble groups with interesting properties, e.g. for the construction of soluble groups of large derived length which seem to be candidates for groups having efficient presentations.New finite soluble groups of derived length six with trivial Schur multiplier and efficient presentations are described.The methods for finding efficient presentations proved to be only practicable for groups of moderate order.Therefore, for a given derived length soluble groups of small order are of interest.The minimal soluble groups of derived length less than or equal to six are classified.