ARDC Research Link Australia Research Link Australia   BETA Research
Link
Australia
  • ARDC Newsletter Subscribe
  • Contact Us
  • Home
  • About
  • Feedback
  • Explore Collaborations
  • Researcher
  • Funded Activity
  • Organisation
  • Researcher
  • Funded Activity
  • Organisation
  • Researcher
  • Funded Activity
  • Organisation

Need help searching? View our Search Guide.

Advanced Search

Current Selection
Research Topic : peer-group
Field of Research : Mathematical Software
Clear All
Filter by Field of Research
Mathematical Software (7)
Pure Mathematics (7)
Group Theory and Generalisations (4)
Group Theory And Generalisations (Incl. Topological Groups And Lie (3)
Algebra and Number Theory (2)
Analysis of Algorithms and Complexity (2)
Rings And Algebras (1)
Filter by Socio-Economic Objective
Expanding Knowledge in the Mathematical Sciences (4)
Mathematical sciences (3)
Expanding Knowledge in the Information and Computing Sciences (1)
Filter by Funding Provider
Australian Research Council (7)
Filter by Status
Closed (6)
Active (1)
Filter by Scheme
Discovery Projects (6)
Discovery Early Career Researcher Award (1)
Filter by Country
Australia (7)
Filter by Australian State/Territory
NSW (4)
WA (2)
VIC (1)
  • Researchers (4)
  • Funded Activities (7)
  • Organisations (6)
  • Funded Activity

    Discovery Early Career Researcher Award - Grant ID: DE140100088

    Funder
    Australian Research Council
    Funding Amount
    $378,628.00
    Summary
    Computing with matrix groups and Lie algebras: new concepts and applications. Computational algebra combines symbolic computation and pure research in algebra, and is concerned with the design of algorithms for solving mathematical problems endowed with algebraic structure. Matrix groups and Lie algebras are prominent algebraic objects describing the natural concept of symmetry. Despite being very common and important in science, there is a paucity of algorithms to study their structure. This pr .... Computing with matrix groups and Lie algebras: new concepts and applications. Computational algebra combines symbolic computation and pure research in algebra, and is concerned with the design of algorithms for solving mathematical problems endowed with algebraic structure. Matrix groups and Lie algebras are prominent algebraic objects describing the natural concept of symmetry. Despite being very common and important in science, there is a paucity of algorithms to study their structure. This project will develop deep new mathematical theories for computing with these objects, leading to ground-breaking advances in computational algebra, and providing powerful tools facilitating new research, including in other sciences. The new functionality will be used to solve two classification problems in group and Lie theory.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP0772368

    Funder
    Australian Research Council
    Funding Amount
    $321,000.00
    Summary
    Constructive Representation Theory and its Applications. The algorithms developed will make it possible to determine the different ways (representations) in which a group of symmetries may be  realised as transformations of some space. Such knowledge is required in many areas including differential equations, digital signal processing, engineering ('strut-and-cable' constructions), the design of telephone networks, crystallography and quantum information processing. The high-performance tools fo .... Constructive Representation Theory and its Applications. The algorithms developed will make it possible to determine the different ways (representations) in which a group of symmetries may be  realised as transformations of some space. Such knowledge is required in many areas including differential equations, digital signal processing, engineering ('strut-and-cable' constructions), the design of telephone networks, crystallography and quantum information processing. The high-performance tools for linear algebra developed will also find application in cryptography and coding theory. This work represents the latest stage in a long-term project to discover practical algorithms for elucidating the properties of complex algebraic structures - an area where Australia is a world-leader.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP0452427

    Funder
    Australian Research Council
    Funding Amount
    $360,000.00
    Summary
    Computational Methods for Matrix Groups and Group Representations. The symmetry of a system is captured mathematically by the notion of a group. A set of matrices closed under multiplication and the taking of inverses is an important example of a group. For instance, the symmetries of many physical systems and other objects are captured by a group of matrices over the complex numbers. This project will develop the computational tools necessary for constructing and analyzing finite matrix groups .... Computational Methods for Matrix Groups and Group Representations. The symmetry of a system is captured mathematically by the notion of a group. A set of matrices closed under multiplication and the taking of inverses is an important example of a group. For instance, the symmetries of many physical systems and other objects are captured by a group of matrices over the complex numbers. This project will develop the computational tools necessary for constructing and analyzing finite matrix groups over infinite fields such as the complex numbers. These methods will find immediate application to many areas of science and engineering and, in particular, to the theory of quantum computation.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP1096599

    Funder
    Australian Research Council
    Funding Amount
    $300,000.00
    Summary
    Constructive Module Theory for Algebras. Cohomology is a highly abstract but very powerful tool. To apply it to particular problems, intricate calculations with abstruse objects are required. The project will represent an important step in a long-term research program being undertaken by Cannon and others to develop computational methods that exploit powerful but deeply abstract ideas in algebra and geometry. Solution of the problems will create considerable interest and find application in seve .... Constructive Module Theory for Algebras. Cohomology is a highly abstract but very powerful tool. To apply it to particular problems, intricate calculations with abstruse objects are required. The project will represent an important step in a long-term research program being undertaken by Cannon and others to develop computational methods that exploit powerful but deeply abstract ideas in algebra and geometry. Solution of the problems will create considerable interest and find application in several branches of mathematics including algebraic geometry and algebraic topology. It will be used both to gain theoretical insight and also to solve concrete problems such as determining whether an equation such as x^3+y^9 = z^2 has a solution in integers.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP160104626

    Funder
    Australian Research Council
    Funding Amount
    $305,500.00
    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 effici .... 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.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP110101153

    Funder
    Australian Research Council
    Funding Amount
    $210,000.00
    Summary
    Symmetry and computation. The overall objective of the project is to explore connections between symmetry and computation, especially the theory and algorithms that facilitate the use of groups in computational science. The main outcome will be theoretically fast algorithms and implementations to drive applications in the sciences and for secure communication.
    More information
    Active Funded Activity

    Discovery Projects - Grant ID: DP190100450

    Funder
    Australian Research Council
    Funding Amount
    $440,000.00
    Summary
    Complexity of group algorithms and statistical fingerprints of groups. This project aims to shape the next generation of efficient randomised algorithms in the field of group theory, the mathematics of symmetry. Fundamental mathematics underpins modern technological tasks such as web searches, sorting and data compression. This project aims to determine characteristic statistical fingerprints of key building-block groups. These group statistics lead to much faster procedures to essentially facto .... Complexity of group algorithms and statistical fingerprints of groups. This project aims to shape the next generation of efficient randomised algorithms in the field of group theory, the mathematics of symmetry. Fundamental mathematics underpins modern technological tasks such as web searches, sorting and data compression. This project aims to determine characteristic statistical fingerprints of key building-block groups. These group statistics lead to much faster procedures to essentially factor huge groups into smaller building-block groups in a manner akin to factoring an integer into its prime factors. The anticipated goal is to include the outcomes in publicly available symbolic algebra computer packages. As the theory of symmetry has broad applications in the mathematical and physical sciences, there is the potential for far reaching benefits.
    Read more Read less
    More information

    Showing 1-7 of 7 Funded Activites

    Advanced Search

    Advanced search on the Researcher index.

    Advanced search on the Funded Activity index.

    Advanced search on the Organisation index.

    National Collaborative Research Infrastructure Strategy

    The Australian Research Data Commons is enabled by NCRIS.

    ARDC CONNECT NEWSLETTER

    Subscribe to the ARDC Connect Newsletter to keep up-to-date with the latest digital research news, events, resources, career opportunities and more.

    Subscribe

    Quick Links

    • Home
    • About Research Link Australia
    • Product Roadmap
    • Documentation
    • Disclaimer
    • Contact ARDC

    We acknowledge and celebrate the First Australians on whose traditional lands we live and work, and we pay our respects to Elders past, present and emerging.

    Copyright © ARDC. ACN 633 798 857 Terms and Conditions Privacy Policy Accessibility Statement
    Top
    Quick Feedback