Group algorithms: Complexity, Theory and Practice. [ 2002-06-02 - 2005-06-01 ]

Research Grant

Researchers: Cheryl Praeger (Chief Investigator) ,  Dr Alice Niemeyer (Chief Investigator)

Brief description Group algorithms: Complexity, Theory and Practice. The symmetry of a mathematical or physical system is often best described by an abstract structure called a group, and groups are commonly represented as groups of permutations or matrices. In this project we shall design and analyse a general algorithmic framework for computing with finite groups. In the context of permutation groups and matrix groups we will produce prototype implementations. The proposed framework has the potential to revolutionise algorithmic group theory as it draws together theoretical and computational models of groups.

Funding Amount $186,000

Funding Scheme Discovery Projects

View this grant in the ARC Data Portal