Discovery Projects - Grant ID: DP0209706

Funding Activity

Website
http://dataportal.arc.gov.au/NCGP/Web/Grant/Grant/DP0209706

Funding Status
Closed

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

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.

Funded Activity Details

Start Date: 02-06-2002

End Date: 01-06-2005

Funding Scheme: Discovery Projects

Funding Amount: $186,000.00

Funder: Australian Research Council

Research Topics

ANZSRC Field of Research (FoR)

Pure Mathematics | Group Theory And Generalisations (Incl. Topological Groups And Lie

ANZSRC Socio-Economic Objective (SEO)

Mathematical sciences |

Other Keywords

Group Theory And Generalisations (Incl. Topological Groups And Lie | Mathematical sciences | Pure Mathematics

Related Links