Discovery Projects - Grant ID: DP160104626

Funding Activity

Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the .

Funded Activity Summary

Composition tree algorithms for large matrix groups. This project aims to develop new algorithms for analysing groups. A group is a rather simple mathematical structure – an example is the set of all integers considering only the operations of addition and subtraction. Since the symmetries of an object form a group, groups are ubiquitous throughout mathematics and elsewhere in science. Because it is frequently necessary to determine a group's properties, there is great interest in finding efficient algorithms for analysing groups. A matrix group is a common type of group whose elements are square matrices. This project plans to employ a novel approach to designing algorithms for analysing large matrix groups, a task which is currently impossible using existing algorithms.

Funded Activity Details

Start Date: 01-01-2016

End Date: 31-12-2018

Funding Scheme: Discovery Projects

Funding Amount: $305,500.00

Funder: Australian Research Council