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
Field of Research : Pure Mathematics
Research Topic : Software
Australian State/Territory : NSW
Clear All
Filter by Field of Research
Pure Mathematics (12)
Mathematical Software (6)
Number Theory And Field Theory (5)
Group Theory And Generalisations (Incl. Topological Groups And Lie (4)
Analysis Of Algorithms And Complexity (3)
Data Security (3)
Discrete Mathematics (2)
Algebra and Number Theory (1)
Analysis of Algorithms and Complexity (1)
Coding And Information Theory (1)
Functions Of Several Complex Variables (1)
Geometry (1)
Group Theory and Generalisations (1)
Mathematical Logic, Set Theory, Lattices And Combinatorics (1)
Rings And Algebras (1)
Topology (1)
Filter by Socio-Economic Objective
Mathematical sciences (9)
Computer software and services not elsewhere classified (6)
Expanding Knowledge in the Mathematical Sciences (2)
Application Software Packages (excl. Computer Games) (1)
Expanding Knowledge in the Information and Computing Sciences (1)
Physical sciences (1)
Filter by Funding Provider
Australian Research Council (12)
Filter by Status
Closed (11)
Active (1)
Filter by Scheme
Discovery Projects (12)
Filter by Country
Australia (12)
Filter by Australian State/Territory
NSW (12)
QLD (1)
SA (1)
VIC (1)
  • Researchers (7)
  • Funded Activities (12)
  • Organisations (9)
  • Active Funded Activity

    Discovery Projects - Grant ID: DP150104108

    Funder
    Australian Research Council
    Funding Amount
    $355,100.00
    Summary
    Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from .... Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from the field of parameterised complexity, creating powerful, practical solutions for these problems. It is expected to shed much-needed light on the vast and puzzling gap between theory and practice, and give researchers fast new software tools for large-scale experimentation and cutting-edge computer proofs.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP0558891

    Funder
    Australian Research Council
    Funding Amount
    $160,000.00
    Summary
    Explicit Construction of Global Function Fields with Many Rational Places. The use of error-correcting codes and cryptosystems is fundamental to the secure and reliable operation of many technological devices that we depend upon in our everyday lives. Essentially invisible, both coding theory and cryptography are essential for banking (ATM machines, e-banking), commerce (e-commerce), defense (cryptography) and entertainment (digital TV and radio, music CDs, DVDs). While certain families of "goo .... Explicit Construction of Global Function Fields with Many Rational Places. The use of error-correcting codes and cryptosystems is fundamental to the secure and reliable operation of many technological devices that we depend upon in our everyday lives. Essentially invisible, both coding theory and cryptography are essential for banking (ATM machines, e-banking), commerce (e-commerce), defense (cryptography) and entertainment (digital TV and radio, music CDs, DVDs). While certain families of "good" codes and cryptosystems can be constructed from specific function fields whose existence is guaranteed by abstract theory, often no actual construction for the function field is currently known. We aim to close this gap, making a greater range of "good" codes and cryptosystems available for practical applications.
    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: DP0881473

    Funder
    Australian Research Council
    Funding Amount
    $230,000.00
    Summary
    Mathematics of Elliptic Curve Cryptography. The Australian society and economy requires fast, reliable, and secure digital infrastructure. First-generation security solutions cannot support the efficiency and scalability requirements of wireless and embedded consumer applications. New security infrastructures are emerging and must be carefully, but rapidly, defined and analysed. Thus developing a new framework in this area is one of the most important and urgent tasks. Besides, the intended wor .... Mathematics of Elliptic Curve Cryptography. The Australian society and economy requires fast, reliable, and secure digital infrastructure. First-generation security solutions cannot support the efficiency and scalability requirements of wireless and embedded consumer applications. New security infrastructures are emerging and must be carefully, but rapidly, defined and analysed. Thus developing a new framework in this area is one of the most important and urgent tasks. Besides, the intended work advances our knowledge of the theory and the quality of our culture. As such, it will promote the Australian science and will also have many practical applications in Computer Security and E-Commerce.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP0450294

    Funder
    Australian Research Council
    Funding Amount
    $250,743.00
    Summary
    Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints. Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distribution of goods etc. - and the theoretical analysis of such networks has become a subject of fundamental importance. Networks can be modelled by graphs. This project will provide new theoretical results which will improve our knowledge of network topologi .... Improving Upper and Lower Bounds on the Order of Large Graphs under Degree and Distance Constraints. Networks govern all aspects of society, including transportation networks, communication networks, computer networks and networks for the distribution of goods etc. - and the theoretical analysis of such networks has become a subject of fundamental importance. Networks can be modelled by graphs. This project will provide new theoretical results which will improve our knowledge of network topologies. The new knowledge will then be utilised in the construction of large graphs with respect to given maximum degree and distance constraints.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP0211459

    Funder
    Australian Research Council
    Funding Amount
    $250,000.00
    Summary
    Number Theoretic Methods in Cryptography. It is well known that Number Theory, besides its intrinsic beauty, provides many powerful tools for modern Cryptography. The aim of the project is to formulate and solve new and important mathematical problems, which lie in the background of modern cryptography. They are also of independent value for pure mathematics because they very often stimulate new approaches to and new surprising points of view on classical results and methods. The main outcome w .... Number Theoretic Methods in Cryptography. It is well known that Number Theory, besides its intrinsic beauty, provides many powerful tools for modern Cryptography. The aim of the project is to formulate and solve new and important mathematical problems, which lie in the background of modern cryptography. They are also of independent value for pure mathematics because they very often stimulate new approaches to and new surprising points of view on classical results and methods. The main outcome will be advancing our theoretical knowledge about several major cryptosystems. The project will extend and enrich the area of applications of mathematics to cryptography and related areas.
    Read more Read less
    More information
    Funded Activity

    Discovery Projects - Grant ID: DP1092835

    Funder
    Australian Research Council
    Funding Amount
    $240,000.00
    Summary
    Mathematics of Cryptography. The Australian economy and society requires fast, reliable, and secure communication. Current first-generation security solutions are not capable of supporting the efficiency and scalability requirements of mass-market adoption of wireless and embedded consumer applications. New security infrastructures are emerging and must be carefully, but rapidly, defined. Thus developing new mathematically solid tools in this area is an important and urgent tasks. In addition, t .... Mathematics of Cryptography. The Australian economy and society requires fast, reliable, and secure communication. Current first-generation security solutions are not capable of supporting the efficiency and scalability requirements of mass-market adoption of wireless and embedded consumer applications. New security infrastructures are emerging and must be carefully, but rapidly, defined. Thus developing new mathematically solid tools in this area is an important and urgent tasks. In addition, the intended work advances our knowledge of the theory and the quality of our culture. As such, it will promote the Australian science and will also have many practical applications in Cryptography, Computer Security and E-Commerce.
    Read more Read less
    More information

    Showing 1-10 of 12 Funded Activites

    • 1
    • 2
    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